English

On the Covering Radius of the Second Order Reed-Muller Code of Length 128

Information Theory 2015-10-30 v1 math.IT

Abstract

In 1981, Schatz proved that the covering radius of the binary Reed-Muller code RM(2,6)RM(2,6) is 18. For RM(2,7)RM(2,7), we only know that its covering radius is between 40 and 44. In this paper, we prove that the covering radius of the binary Reed-Muller code RM(2,7)RM(2,7) is at most 42. Moreover, we give a sufficient and necessary condition for Boolean functions of 7-variable to achieve the second-order nonlinearity 42.

Keywords

Cite

@article{arxiv.1510.08535,
  title  = {On the Covering Radius of the Second Order Reed-Muller Code of Length 128},
  author = {Qichun Wang},
  journal= {arXiv preprint arXiv:1510.08535},
  year   = {2015}
}