Subcodes and covering radius (Corresp.)

A sharp lower bound on the covering radius of a linear, binary code is given in terms of the covering radius of any subcode of index two. An upper bound on the norm of a code is then derived. These results hold for all linear codes over GF
(2)
.