On the covering radius of binary codes (Corresp.)

Authors:
  • THT. Helleseth
    T. Helleseth
  • TKT. Klove
    T. Klove
  • JMJ. Mykkeltveit
    J. Mykkeltveit

Abstract
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}.

This publication has 6 references indexed in Scilit: