Viterbi decoding algorithm for convolutional codes with repeat request
- 1 September 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 26 (5) , 540-547
- https://doi.org/10.1109/tit.1980.1056245
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Truncation Error Probability in Viterbi DecodingIEEE Transactions on Communications, 1977
- Convolutional codes II. Maximum-likelihood decodingInformation and Control, 1974
- Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)IEEE Transactions on Information Theory, 1973
- Convolutional Codes and Their Performance in Communication SystemsIEEE Transactions on Communication Technology, 1971
- Viterbi Decoding for Satellite and Space CommunicationIEEE Transactions on Communication Technology, 1971
- Lower bounds on reliability functions of variable-length nonsystematic convolutional codes for channels with noiseless feedbackIEEE Transactions on Information Theory, 1971
- On the Viterbi decoding algorithmIEEE Transactions on Information Theory, 1969
- Exponential error bounds for erasure, list, and decision feedback schemesIEEE Transactions on Information Theory, 1968
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithmIEEE Transactions on Information Theory, 1967