Some extended results on the search for good convolutional codes

Author

Chang, Jinn-Ja ; Hwang, Der-June ; Lin, Mao-Chao

Author_Institution

Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei, Taiwan

Volume

43

Issue

5

fYear

1997

fDate

9/1/1997 12:00:00 AM

Firstpage

1682

Lastpage

1697

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 values

Keywords

convolutional codes; linear codes; search problems; transfer function matrices; binary codes; binary-to-M-ary codes; computer search; convolutional codes; distance spectra; extended results; free distances; information-weight spectra; nonbinary codes; q-ary-to-M-ary codes; transfer function matrices; upper bound; Binary codes; Convolution; Convolutional codes; Interference channels; Linear code; Rayleigh channels; Signal detection; Transfer functions; Transmitters; Upper bound;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.623175

Filename

623175