On the covering radius of binary codes (Corresp.)
Tor Helleseth, Torleiv Kløve, Johannes Mykkeltveit · IEEE Transactions on Information Theory · 1978
Upper bounds on the covering radius of binary codes are studied. In particular it is shown that the covering radiusr_{m}of the first-order Reed-Muller code of lenglh2^{m}satisfies2^{m-l}-2^{\lceil m/2 \rceil -1} r_{m} \leq 2^{m-1}-2^{m/2-1}.