Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 19 (3) , 371-372
- https://doi.org/10.1109/tit.1973.1055014
Abstract
This paper gives a tabulation of binary convolutional codes with maximum free distance for ratesfrac{1}{2}, frac{1}{3}, andfrac{1}{4}for all constraint lengths (measured in information digits)nuup to and includingnu = 14. These codes should be of practical interest in connection with Viterbi decoders.Keywords
This publication has 7 references indexed in Scilit:
- An efficient algorithm for computing free distance (Corresp.)IEEE Transactions on Information Theory, 1972
- Rate 1/2 convolutional codes with complementary generatorsIEEE Transactions on Information Theory, 1971
- Viterbi Decoding for Satellite and Space CommunicationIEEE Transactions on Communication Technology, 1971
- Nonsystematic convolutional codes for sequential decoding in space applicationsIEEE Transactions on Communication Technology, 1971
- On the Viterbi decoding algorithmIEEE Transactions on Information Theory, 1969
- Inverses of Linear Sequential CircuitsIEEE Transactions on Computers, 1968
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960