Majority decoding of some classes of binary cyclic codes | IEEE Journals & Magazine | IEEE Xplore
Scheduled Maintenance: On Monday, 27 January, the IEEE Xplore Author Profile management portal will undergo scheduled maintenance from 9:00-11:00 AM ET (1400-1600 UTC). During this time, access to the portal will be unavailable. We apologize for any inconvenience.

Majority decoding of some classes of binary cyclic codes


Abstract:

This paper presents majority-decoding algorithms for four classes of binary cyclic codes. The classes are those for which the parity-check polynomial is: 1) the product o...Show More

Abstract:

This paper presents majority-decoding algorithms for four classes of binary cyclic codes. The classes are those for which the parity-check polynomial is: 1) the product of two primitive polynomials with relatively prime exponents and 2) the product of(x^r + 1)/(x + 1)and a primitive polynomial, wherer \geq 3is odd and the exponents are relatively prime, together with the corresponding nonexpurgated codes.
Published in: IEEE Transactions on Information Theory ( Volume: 20, Issue: 5, September 1974)
Page(s): 637 - 643
Date of Publication: 30 September 1974

ISSN Information:


References

References is not available for this document.