Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
IEEE Transactions on Information Theory · 1967 · 6,971 citations
No retraction on record in OpenAlex.Check Crossref now
Cite this paper
Viterbi, A. J. (1967). Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory, 13(2), 260–269. https://doi.org/10.1109/tit.1967.1054010
In text: (Viterbi, 1967)
Ask a question about this research
One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.
Abstract
The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length of the code. For all but pathological channels the bounds are asymptotically (exponentially) tight for rates aboveR_{0}, the computational cutoff rate of sequential decoding. As a function of constraint length the performance of optimal convolutional codes is shown to be superior to that of block codes of the same length, the relative improvement increasing with rate. The upper bound is obtained for a specific probabilistic nonsequential decoding algorithm which is shown to be asymptotically optimum for rates aboveR_{0}and whose performance bears certain similarities to that of sequential decoding algorithms.
Related papers
Metadata from OpenAlex (CC0). Citations are generated from the published record.