论文信息 - Decoding binary two-error correcting cyclic codes with Zech logarithms

Decoding binary two-error correcting cyclic codes with Zech logarithms

A decoding method for binary two-error correcting cyclic codes whose generator polynomials have at most two irreducible factors is presented. This class includes binary narrow-sense BCH codes with designed distance 5. The decoding algorithm uses the Zech logarithm for the finite field in which the roots of the code lie. >

Harold N. Ward | Patrick Stevens

[1] Larry A. Dunning,et al. Optimal Encodings of Linear Block Codes for Unequal Error Protection , 1978, Inf. Control..

[2] Wil J. van Gils,et al. Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes , 1983, IEEE Trans. Inf. Theory.

[3] Kyoki Imamura. A method for computing addition tables in GF(pn) (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[4] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[5] I. M. Boyarinov,et al. Linear unequal error protection codes , 1981, IEEE Trans. Inf. Theory.

[6] Shu Lin,et al. Error control coding : fundamentals and applications , 1983 .

[7] Patrick Stevens. Extension of the BCH decoding algorithm to decode binary cyclic codes up to their maximum error correction capacities , 1988, IEEE Trans. Inf. Theory.