An upper bound on the minimum distance of a convolutional code
- 1 October 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 11 (4) , 567-571
- https://doi.org/10.1109/tit.1965.1053830
Abstract
An upper bound on the minimum distance of a linear convolutional code is given which reduces to the Plotkin bound for the block code case. It is shown that most linear convolutional codes have a minimum distance strictly less than their average distance. A table of the bound for several rates is given for binary codes as well as a comparison with the known optimum values for codes of block length2.Keywords
This publication has 2 references indexed in Scilit:
- Some properties of binary convolutional code generatorsIEEE Transactions on Information Theory, 1965
- Analysis of recurrent codesIEEE Transactions on Information Theory, 1963