Studying the Locator Polynomials of Minimum Weight Codewords of BCH Codes

IEEE Transactions on Information Theory

Volumn 38, Issue 3, 1992, Pages 960-973

  Charpin, Pascale ^b   Sendrier, Nicolas ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b INRIA   (France)

Author keywords

BCH code; code locator polynomial; Cyclic code; Newton's identities; Reed Muller

Indexed keywords

MATHEMATICAL TECHNIQUES - POLYNOMIALS;

BCH CODES; BINARY CODES; CYCLIC CODES; NEWTON'S IDENTITIES; REED-MULLER CODES;

CODES, SYMBOLIC;

EID: 0026869210     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.135638     Document Type: Article

References (13)

1. E. F. Assmus and J. D. Key, “Affine and projective planes,” Discrete Math., vol. 83, pp. 161–187, 1990.
2. P. Charpin, “Codes cycliques etendus affines-invariants et antichaines d'un ensemble partiellement ordonne,” Discrete Math., vol. 80, pp. 229–247, 1990.
3. G. Cohen, “Distance Minimale et Enumeration des Poids des Codes Lineaires,” These de 3 e Cycle, ENST, Apr. 1976.
4. G. Cohen, “On the minimum distance of some BCH codes,” IEEE Trans. Inform. Theory, vol. 26, p. 363, May 1980.
5. J.L. Domstetter, “Quelques resultats sur les codes BCH binaires en longueur 255,” ENST stage rep., Annex, July 1982.
6. H. J. Helgert and R. D. Stinaff, “Shortened BCH codes,” IEEE Trans. Inform. Theory, vol. 19, pp. 818–820, Nov. 1973.
7. T. Kasami and S. Lin, “Some results on the minimum weight of primitive BCH codes,” IEEE Trans. Inform. Theory, vol. 18, pp. 824–825, Nov. 1972.
8. T. Kasami, S. Lin, and W. W. Peterson, “Some results on cyclic codes which are invariant under the affine group and their applications,” Inform. Contr., vol. 11, pp. 475–496, 1967.
9. T. Kasami, S. Lin, and W. W. Peterson, “New generalisations of the Reed-Muller codes—Part I: Primitive codes,” IEEE Trans. Inform. Theory, vol. 14, pp. 189–199, Mar. 1968.
10. T. Kasami and N. Tokura, “Some remarks on BCH bounds and minimum weights of binary primitive BCH codes,” IEEE Trans. Inform. Theory, vol. 15, pp. 408–413, May 1969.
11. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error Correcting Codes. Amsterdam: North-Holland, 1986.
12. W. W. Peterson, Error-Correcting Codes. Cambridge, MA: MIT Press, 1961.
13. J. H. van Lint and R. M. Wilson, “On the minimum distance of cyclic codes,” IEEE Trans. Inform. Theory, vol. 32, pp. 23–40, Jan. 1986.