论文信息 - An efficient algorithm for computing free distance (Corresp.) - 字舞流文

An efficient algorithm for computing free distance (Corresp.)

An efficient bidirectional search algorithm for computing the free distance of convolutional codes is described.

Lalit R. Bahl | Frederick Jelinek | C. Cullum | W. D. Frazer

[1] Lalit R. Bahl,et al. Rate 1/2 convolutional codes with complementary generators , 1971, IEEE Trans. Inf. Theory.

[2] Andrew J. Viterbi,et al. Error bounds for convolutional codes and an asymptotically optimum decoding algorithm , 1967, IEEE Trans. Inf. Theory.

[3] G. David Forney. Use of a sequential decoder to analyze convolutional code structure (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[4] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[5] D. J. Costello. Construction of convolutional codes for sequential decoding , 1969 .

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