Improved Gilbert bound for convolutional codes (Corresp.)
- 1 April 1967
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 13 (2) , 333-335
- https://doi.org/10.1109/tit.1967.1054008
Abstract
It is shown that an improved Gilbert bound for convolutional codes can be obtained for the class of codes derivable from a good short code. Numerical results for the binary case illustrate the improvement.Keywords
This publication has 5 references indexed in Scilit:
- Some results on binary convolutional code generators (Corresp.)IEEE Transactions on Information Theory, 1967
- On the equivalence of two convolution code definitions (Corresp.)IEEE Transactions on Information Theory, 1965
- Some properties of binary convolutional code generatorsIEEE Transactions on Information Theory, 1965
- Analysis of recurrent codesIEEE Transactions on Information Theory, 1963
- THRESHOLD DECODINGPublished by Defense Technical Information Center (DTIC) ,1963