Shortened BCH Codes

IEEE Transactions on Information Theory

Volumn 19, Issue 6, 1973, Pages 818-820

  Helgert, H J ^a   Stinaff, R D ^a  

^a CLEMSON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (9)

1. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
2. W. W. Peterson and E. J. Weldon, Error-Correcting Codes, 2nd ed. Cambridge, Mass.: M.I.T. Press, 1972.
3. C. L. Chen, “Computer results on the minimum distance of some binary cyclic codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-16, pp. 359-360, May 1970.
4. 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.
5. H. D. Goldman, M. Kliman, and H. Smola, “The weight structure of some Bose-Chaudhuri codes,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-14, pp. 167-169, Jan-1968.
6. D. R. Anderson, “A new class of cyclic codes,” SIAM J. Appl. Math., vol. 16, pp. 181-197, 1968.
7. N. J. A. Sloane, “A survey of constructive coding theory, and a table of codes of known rate,” Discrete vol. 1972.
8. H. J. Helgert and R. D. Stinaff, “Minimum distance bounds for binary linear codes,” IEEE Trans. Inform. Theory, vol. IT-19, pp. 344-356, May 1973.
9. J. M. Goethals, “On the Golay perfect binary code,” J. Comb. Theory, vol. 11, pp. 178-186, 1971.