On the covering radius of A(1 m) in R(3, m)

IEEE Transactions on Information Theory

Volumn 42, Issue 3, 1996, Pages 1035-1037

  Hou, Xiang Dong ^a  

^a WRIGHT STATE UNIVERSITY   (United States)

Author keywords

Covering radius; Quadratic bound; Reed muller codes

Indexed keywords

CODES (SYMBOLS); FOURIER TRANSFORMS; MATRIX ALGEBRA; OPTIMIZATION; THEOREM PROVING;

COVERING RADIUS; QUADRATIC BOUND; REED-MULLER CODES;

INFORMATION THEORY;

EID: 0030151089     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.490572     Document Type: Article

References (13)

1. J. Ax, "Zeroes of polynomials over finite fields," Amer. J. Math., vol. 86, pp. 255-261, 1964.
2. E. Bcrlckamp and L. R. Welch, "Weight distributions of the cosets of the (32.0) Reed-Muller code," IEEE Trans. Inform. Theory, vol. 18, no. 1, pp. 203-207, 1972.
3. C. Carlet, "A transformation on Boolean functions, its consequences on some problems related to Reed-Muller codes," in Lecture Notes in Computer Science, vol. 514 (Eurocode 90). Berlin. Germay: Springer-Verlag. 1991, pp. 42-50.
4. T. Helleseth, T. Kløve, and J. Mykkeltveit, "On Ihe covering radius of binary codes," IEEE Trans. Inform. Theory, vol. IT-24, no. 5, pp. 627-628, 1978.
5. X. Hou, "Further results on the covering radii of the Rccd-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 Ser. A, to appear.
7. P. Langevin, "The covering radius of RM(1, 9) into RM(3, 9)," in Lecture Notes in Computer Science, vol. 514 (Eurocode 90). Berlin, Gerniay: Springer-Verlag. 1991, pp. 51-59.
8. _, "On the orphans and covering radius of the Reed-Muller codes," in Lecture Notes in Computer Science, vol. 539. Berlin, Germay: Springer-Verlag, 1991, pp. 234-240.
9. J. Mykkeltveit, 'The covering radius of the(128, 8) Reed-Muller code is 56," IEEE Trans. Inform. Theory, vol. IT-26, no. 3, pp. 359-362, 1980.
10. N.J. Patterson and D. H. Wiedemann, "The covering radius of the (215, 16) Reed-Muller code is at least 16276," IEEE 'Irans. Inform. Theory, vol. IT-29, no. 3, pp. 354-356, 1983.
11. _, "Correction to [10]," IEEE Trans. Inform. Theory, vol. 36, p. 443, 1990.
12. V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed. New York: Wiley, 1989.
13. N.J. A. Sloane and E. R. Berlekamp, "Weight enumerator for second-order Reed-Muller codes," IEEE Trans. Inform. Theory, vol. IT-16, no. 6, pp. 745-751, 1970.