On the norm and covering radius of the first-order reed-muller codes

IEEE Transactions on Information Theory

Volumn 43, Issue 3, 1997, Pages 1025-1027

  Hou, Xiang Dong ^a  

^a WRIGHT STATE UNIVERSITY   (United States)

Author keywords

Covering radius; Norm; Reed Muller codes

Indexed keywords

ENCODING (SYMBOLS); INFORMATION THEORY; MATHEMATICAL TECHNIQUES; THEOREM PROVING;

COVERING RADIUS; NORM;

CODES (SYMBOLS);

EID: 0031139263     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.568715     Document Type: Article

References (13)

1. R. A. Brualdi and V. S. Pless, "Orphans of the first-order Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 36, pp. 399-401, Mar. 1990.
2. G. D. Cohen, S. N. Litsyn, A. C. Lobstein, and H. F. Mattson, Jr., "Covering radius 1985-1995," AAECC, to be published.
3. R. L. Graham and N. J. A. Sloane, "On the covering radius of codes," IEEE Trans. Inform. Theory, vol. IT-31, pp. 385-401, May 1985.
4. T. Helleseth, T. Kløve, and J. Mykkeltveit, "On the covering radius of binary codes," IEEE Trans. Inform. Theory, vol. IT-24, pp. 627-628, Sept. 1978.
5. X. Hou, "Further results on the covering radii of the Reed-Muller codes," Des. Codes Cryptogr., vol. 3, pp. 167-177, 1993.
6. _, "Covering radius of the Reed-Muller code R(1, 7) - A simpler proof," J. Combin. Theory, vol. 74A, pp. 337-341, 1996.
7. _, "The Reed-Muller code A(1,7) is normal," Des. Codes Cryptogr., to be published.
8. P. Langevin, "On the orphans and covering radius of the Reed-Muller codes," in Lecture Notes in Computer Science, vol. 539. Berlin, Germany: Springer, 1991, pp. 234-240.
9. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
10. J. Mykkeltveit, "The covering radius of the (128, 8) Reed-Muller code is 56," IEEE Trans. Inform. Theory, vol. IT-26, pp. 359-362, May 1980.
11. 15, 6) Reed-Muller code is at least 16276," IEEE Trans. Inform. Theory, vol. IT-29, pp. 354-356, May 1983.
12. N. J. Patterson and D. H. Wiedemann, IEEE Trans. Inform. Theory vol. 36, p. 443, 1990.
13. O. S. Rothaus, "On 'bent' functions," J. Combin. Theory, vol. 20A, pp. 300-305, 1976.