Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)
- 1 September 1974
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 20 (5) , 683-689
- https://doi.org/10.1109/tit.1974.1055264
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Structural analysis of convolutional codes via dual codesIEEE Transactions on Information Theory, 1973
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al.IEEE Transactions on Information Theory, 1973
- Short convolutional codes with maximal free distance for rates 1/2, 1/3, and 1/4 (Corresp.)IEEE Transactions on Information Theory, 1973
- Minimum-distance bounds for binary linear codesIEEE Transactions on Information Theory, 1973
- An efficient algorithm for computing free distance (Corresp.)IEEE Transactions on Information Theory, 1972
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970
- Inverses of Linear Sequential CircuitsIEEE Transactions on Computers, 1968