论文信息 - Pseudostep orthogonalization: A new threshold-decoding algorithm (Corresp.)

Pseudostep orthogonalization: A new threshold-decoding algorithm (Corresp.)

In this correspondence a new decoding algorithm using majority logic is proposed. This scheme, called "pseudostep orthogonalization," is basically a hybrid version of the existing majority-logic decoding methods, namely, Reed-Massey's algorithm and Rudolph's algorithm. An example is given for the (21, 5) binary cyclic code, which can correct up to four independent errors.

Nguyen Duc | Nguyen Duc

[1] Luther D. Rudolph. Threshold decoding of cyclic codes , 1969, IEEE Trans. Inf. Theory.

[2] Irving S. Reed,et al. A class of multiple-error-correcting codes and the decoding scheme , 1954, Trans. IRE Prof. Group Inf. Theory.

[3] B. Elspas,et al. The Theory of Autonomous Linear Sequential Networks , 1959 .

[4] Luther D. Rudolph,et al. A class of majority logic decodable codes (Corresp.) , 1967, IEEE Trans. Inf. Theory.

[5] Willis C. Gore. Generalized threshold decoding and the Reed-Solomon codes , 1969, IEEE Trans. Inf. Theory.

[6] Algorithms for majority-logic check equations of maximal-length codes , 1969 .

[7] Shu Lin,et al. On majority-logic decoding for duals of primitive polynomial codes , 1971, IEEE Trans. Inf. Theory.

[8] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[9] Chin-Long Chen,et al. Computer results on the minimum distance of some binary cyclic codes (Corresp.) , 1970, IEEE Transactions on Information Theory.