Theoretical upper bounds on the covering radii of Boolean functions
Michel Mitton · Journal of Discrete Mathematical Sciences and Cryptography · 2004
We prove new upper bounds for the covering radii ρ(n) and ρB (n) of the first order Reed-Muller code R(1, n). Although these bounds be actually theoretical, they improve the classical Helleseth-KIøve-Mykkeltveit (H.K.M.) bound