Idempotents and the BCH Bound

IEEE Transactions on Information Theory

Volumn 40, Issue 1, 1994, Pages 204-207

  Augot, Daniel ^a   Sendrier, Nicolas ^b  

^a SORBONNE UNIVERSITÉ   (France)

^b INRIA   (France)

Author keywords

BCH codes; idempotents; locator polynomial; minimum distance; splitting field

Indexed keywords

ALGORITHMS; DECISION TABLES; INFORMATION THEORY; MATHEMATICAL MODELS; POLES AND ZEROS; POLYNOMIALS; SET THEORY; SIGNAL THEORY; THEOREM PROVING;

BCH CODES; IDEMPOTENTS; LOCATOR POLYNOMIALS; MINIMUM DISTANCE; MINIMUM WEIGHT CODEWORDS; SPLITTING FIELDS;

CODES (SYMBOLS);

EID: 0028202723     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.272483     Document Type: Article

References (4)

1. D. Augot, P. Charpin, and N. Sendrier, “Studying the locator polynomials of minimum weight codewords of BCH codes,” IEEE Trans. Inform. Theory, vol. 38, pp. 960-973, May 1992.
2. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam: North-Holland, 1977.
3. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: M.I.T. Press, 1972.
4. J. H. van Lint and R. M. Wilson, “On the minimum distance of cyclic codes,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 23-40, Jan. 1986.