论文信息 - High rate convolutional codes with good distance profiles (Corresp.)

High rate convolutional codes with good distance profiles (Corresp.)

The result of a computer search for systematic convolutional codes with rates (N - 1)/N for N from 3 to 8 is presented. The codes have rapidly growing column distance, making them attractive for sequential decoding.

Joachim Hagenauer

[1] Daniel J. Costello. A construction technique for random-error-correcting convolutional codes , 1969, IEEE Trans. Inf. Theory.

[2] Erik Paaske,et al. Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3] Rolf Johannesson,et al. Robustly optimal rate one-half binary convolutional codes (Corresp.) , 1975, IEEE Trans. Inf. Theory.

[4] Shu Lin,et al. Some results on binary convolutional code generators (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[5] Robert B. Ash,et al. Analysis of recurrent codes , 1963, IEEE Trans. Inf. Theory.

[6] Daniel J. Costello,et al. Distance and computation in sequential decoding , 1976, IEEE Transactions on Communications.

[7] F. Jelinek. Fast sequential decoding algorithm using a stack , 1969 .

[8] John P. Robinson. An upper bound on the minimum distance of a convolutional code , 1965, IEEE Trans. Inf. Theory.