Some extended results on the search for good convolutional codes
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 43 (5), 1682-1697
- https://doi.org/10.1109/18.623175
Abstract
We provide useful results on two classes of convolutional codes: binary codes and nonbinary codes. The best codes or the best known codes for these two classes of convolutional codes are found, by computer search. Some of them are better than those found in the past. We specify these codes by their transfer function matrices, distance spectra, and information-weight spectra. Furthermore, we derive an upper bound on the free distances of binary-to-M-ary codes and q-ary-to-M-ary codes. Numerical values of this bound closely fit the computer-searched valuesKeywords
This publication has 12 references indexed in Scilit:
- Two classes of convolutional codes over GF(q) for q-ary orthogonal signalingIEEE Transactions on Communications, 1991
- A fast algorithm for computing distance spectrum of convolutional codesIEEE Transactions on Information Theory, 1989
- The Weight Spectra of Some Short Low-Rate Convolutional CodesIEEE Transactions on Communications, 1984
- Multiple-word correcting convolutional codesIEEE Transactions on Information Theory, 1984
- New short constraint length convolutional code constructions for selected rational rates (Corresp.)IEEE Transactions on Information Theory, 1982
- Further results on binary convolutional codes with an optimum distance profile (Corresp.)IEEE Transactions on Information Theory, 1978
- 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
- 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