论文信息 - Some Results on the Distance Properties of Convolutional Codes

Some Results on the Distance Properties of Convolutional Codes

Rate 1/2 binary convolutional codes are analyzed and a lower bound on free distance in terms of the minimum distances of two associated cyclic codes is derived. Next, the complexity of computing the free distance is discussed and a counterexample to a conjecture on the relationship of row distance to free distance for systematic codes is presented. Finally, an improved Gilbert bound for definite decoding is derived. SECTION

Luther D. Rudolph | Alexander Miczo

[1] Luther D. Rudolph,et al. A note on the free distance of a convolutional code (Corresp.) , 1970, IEEE Trans. Inf. Theory.

[2] J. L. Massey. Some algebraic and distance properties of convolutional codes. , 1968 .

[3] John P. Robinson. Error propagation and definite decoding of convolutional codes , 1968, IEEE Trans. Inf. Theory.

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

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

[6] J. L. Massey. Catastrophic error-propagation in convolutional codes. , 1968 .