Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
Andrew J. Viterbi · IEEE Transactions on Information Theory · 1967
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.
Cited by 6,759 works. doi:10.1109/tit.1967.1054010
Authors
References
- Transmission of Information.
- Transmission of Information
- A heuristic discussion of probabilistic decoding
- A simple derivation of the coding theorem and some applications
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Lower bounds to error probability for coding on discrete memoryless channels. II
- The Noisy Channel Coding Theorem for Erasure Channels
- Sequential encoding and decoding for the discrete memoryless channel
- Sequential Decoding - The Computation Problem*
- Channel state testing in information decoding.