The Covering Radius of the (215, 16) Reed–Muller Code Is at Least 16276

IEEE Transactions on Information Theory

Volumn 29, Issue 3, 1983, Pages 354-356

  Patterson, N J ^a   Wiedemann, Douglas H ^a  

^a INSTITUTE FOR DEFENSE ANALYSES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

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

References (6)

1. O. Rothaus, “On ‘bent’ functions,” J. Comb. Theory, ser. A, vol. 20, pp. 300-305, 1976.
2. 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.
3. E. R. Berlekamp and L. R. Welch, “Weight distributions of the cosets of the (32, 6) Reed-Muller code,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 203-207, Jan. 1972.
4. 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.
5. J. F. Dillon, “Elementary Hadamard difference sets,” in Proc. 6th S. E. Conf. Combinatorics, Graph Theory, and Computing, Utilitas Math., Winnipeg, pp. 237-249, 1975.
6. J. W. Hirschfeld, Projective Geometries over Finite Fields. New York: Oxford University, 1979.