An algebraic construction of rate1/v-ary codes; algebraic construction (Corresp.)
- 1 September 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 21 (5) , 577-580
- https://doi.org/10.1109/tit.1975.1055436
Abstract
If the constraint length of a convolutional code is defined suitably, it is an obvious upper bound on the free distance of the code, and it is sometimes possible to find codes that meet this bound. It is proved here that the length of a rate1/\nu q-ary code with this property is at mostq\nu, and we construct a class of such codes with lengths greater thanq\nu/3.Keywords
This publication has 6 references indexed in Scilit:
- On maximum-distance-separable convolutional codes (Corresp.)IEEE Transactions on Information Theory, 1974
- New convolutional code constructions and a class of asymptotically good time-varying codesIEEE Transactions on Information Theory, 1973
- Polynomial weights and code constructionsIEEE Transactions on Information Theory, 1973
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- Convolutional codes I: Algebraic structureIEEE Transactions on Information Theory, 1970
- Polynomial Codes Over Certain Finite FieldsJournal of the Society for Industrial and Applied Mathematics, 1960