Abstract
We prove that the Reed-Muller code R(1,7) is normal. The normality of R(1,7) was a long-standing open question, and has an important consequence in a conjecture about the function t[n,k], the smallest covering radius of any [n,k] binary linear code.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. A. Brualdi, N. Cai, and V. S. Pless, Orphans structure of the first order Reed-Muller codes, Discrete Math., Vol. 102, (1992) pp. 239–247.
R. L. Graham and N. J. A. Sloane, On the covering radius of codes, IEEE Trans. Inform. Theory, Vol. IT-31,No. 3 (1985) pp. 385–401.
T. Helleseth, T. Kløve, and J. Mykkeltveit, On the covering radius of binary codes, IEEE Inform. Theory, Vol. IT-24,No. 5 (1978) pp. 627–628.
X. Hou, Covering radius of error-correcting codes, Ph.D. Thesis, University of Illinois at Chicago (1990).
X. Hou, Binary linear quasi-perfect codes are normal, IEEE Trans. Inform. Theory, Vol. IT-37,No. 2 (1991) pp. 378–379.
X. Hou, Covering radius of the Reed-Muller code R(1, 7)--A simpler proof, J. Combin. Theory A, Vol. 74 (1996) pp. 337–341.
P. Langevin, On the orphans and covering radius of the Reed-Muller codes, Lecture Notes in Comput. Sci., Springer, Berlin, 539 (1991) pp. 234–240.
J. Mykkeltveit, The covering radius of the (128,8) Reed-Muller code is 56, IEEE Inform. Theory, Vol. IT-26,No. 3 (1980) pp. 359–362.
V. Pless, Introduction to the Theory of Error-Correcting Codes, 2nd ed., Wiley, New York, (1989).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hou, XD. The Reed-Muller Code R(1,7) Is Normal. Designs, Codes and Cryptography 12, 75–82 (1997). https://doi.org/10.1023/A:1008297926857
Issue Date:
DOI: https://doi.org/10.1023/A:1008297926857