pith. sign in

arxiv: 1510.08535 · v1 · pith:GY5RP6STnew · submitted 2015-10-29 · 💻 cs.IT · math.IT

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

classification 💻 cs.IT math.IT
keywords coveringradiuscodereed-mullerbinaryachievebooleancondition
0
0 comments X
read the original abstract

In 1981, Schatz proved that the covering radius of the binary Reed-Muller code $RM(2,6)$ is 18. For $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)$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.