Regular Section
The Covering Radius of the Reed-Muller Code R(3, 7) in R(5, 7) Is 20
2019 Volume E102.A Issue 3 Pages 594-597
Details
2019 Volume E102.A Issue 3 Pages 594-597
We propose a recursive algorithm to reduce the computational complexity of the r-order nonlinearity of n-variable Boolean functions. Applying the algorithm and using the sufficient and necessary condition put forward by [1] to cut the vast majority of useless search branches, we show that the covering radius of the Reed-Muller Code R(3, 7) in R(5, 7) is 20.
