Extending and lengthening BCH codes

Finite Fields and their Applications

Volumn 3, Issue 4, 1997, Pages 314-333

  Bierbrauer, Jürgen ^a   Edel, Yves ^b  

^a MICHIGAN TECHNOLOGICAL UNIVERSITY   (United States)

^b UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031259071     PISSN: 10715797     EISSN: None     Source Type: Journal    
DOI: 10.1006/ffta.1997.0188     Document Type: Article

References (12)

1. Alltop W. O. A method for extending binary linear codes. IEEE Trans. Inform. Theory. 30:1984;871-872.
2. Augot D., Charpin P., Sendrier N. Studying the locator polynomials of minimum weight codewords ofBCH. IEEE Trans. Inform. Theory. 38:1992;960-973.
3. Bierbrauer J. Construction of orthogonal arrays. J. Statist. Planning Inference. 56:1996;39-47.
4. J. Bierbrauer, http://www.math.mtu.edu/home/math/jbierbra/Home.html.
5. Bierbrauer J., Edel Y. New code-parameters from Reed-Solomon subfield codes. IEEE Trans. Inform. Theory. 43:1997;953-968.
6. A. E. Brouwer, Data base of bounds for the minimum distance for binary, ternary and quaternary codes, http://www.win.tue.nl/win/math/dw/voorlincod.html or http://www.cwi.nl/htbin/aeb/lincodbd/2/136/114 or ftp://ftp.win.tue.nl/pub/math/codes/table[234].gz.
7. Brouwer A. E., Verhoeff T. An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Inform. Theory. 39:1993;662-677.
8. Delsarte P. On subfield subcodes of modified Reed-Solomon codes. IEEE Trans. Inform. Theory. 21:1975;575-576.
9. Groneick B., Grosse S. New binary codes. IEEE Trans. Inform. Theory. 40:1994;510-512.
10. Kasami T., Tokura N. Some remarks on BCH bounds and minimum weights of binary primitive BCH codes. IEEE Trans. Inform Theory. 15:1969;408-413.
11. MacWilliams F. J., Sloane N. J. A. The Theory of Error-Correcting Codes. 1992;North-Holland, Amsterdam.
12. Rédei L. Lückenhafte Polynome. 1970;Birkhäuser, Basel/Stuttgart.