Another upper bound on covering radius
Harold F. Mattson · IEEE Transactions on Information Theory · 1983
A new upper bound on the covering radius of binary linear codes improves on previously known bounds for some codes. The bound is[W/2]+\rho_{2}, whereWis one of the weights occurring among the codewords, and\rho_{2}is the covering radius of an associated code. Some comparisons with other bounds are made.