The Covering Radius of the Reed-Muller Code R(3, 7) in R(5, 7) Is 20
Li Gui, Qichun Wang, Shi Shu · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2019
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.