Some Results on the Minimum Weight of Primitive BCH Codes

IEEE Transactions on Information Theory

Volumn 18, Issue 6, 1972, Pages 824-825

  Kasami, T ^a   Lin, S ^b  

^a OSAKA UNIVERSITY   (Japan)

^b UNIVERSITY OF HAWAII   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BCH CODES;

CODES, SYMBOLIC;

EID: 0347367147     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1972.1054903     Document Type: Article

References (6)

1. T. Kasami, S. Lin, and W. W. Peterson, “Linear codes which are invariant under the affine group and some results on minimum weights of BCH codes,” J. Inst. Electron. Commun. Eng. Jap., vol. 50, pp. 1617-1622, Sept. 1967.
2. W. W. Peterson, “Some new results on finite fields with applications to BCH codes,” in Combinatorial Mathematics and Its Applications, R. C. Bose and T. A. Dowling, Eds. Chapel Hill, N.C.: Univ. North Carolina Press, 1969.
3. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill 1968.
4. —, “The weight enumerators for certain subcodes of the 2nd order binary Reed-Muller code,” Inform. Contr., vol. 17, pp. 485–500, 1970.
5. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, Mass.: M.I.T. Press, 1971.
6. T. Kasami and N. Tokura, “Some remarks on BCH bounds and minimum weights of binary primitive BCH codes,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 408–413, May 1969.