Title :
New rate 1/2, 1/3, and 1/4 binary convolutional encoders with an optimum distance profile
Author :
Johannesson, Rolf ; Ståhl, Per
Author_Institution :
Dept. of Inf. Technol., Lund Univ., Sweden
fDate :
7/1/1999 12:00:00 AM
Abstract :
Tabulations of binary systematic and nonsystematic polynomial convolutional encoders with an optimum distance profile for rate 1/2, 1/3, and 1/4 are given. The reported encoders are found by computer searches that optimize over the weight spectra. The free distances for rate 1/3 and 1/4 are compared with Heller´s (1968) and Griesmer´s (1960) upper bounds
Keywords :
binary codes; convolutional codes; binary nonsystematic polynomial convolutional encoders; binary systematic polynomial convolutional encoders; code rate; computer searches; free distances; optimum distance profile; upper bounds; weight spectra; Concatenated codes; Convolutional codes; Error probability; IEEE Press; Information theory; Lakes; Maximum likelihood decoding; Polynomials; Reliability theory; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
