A note on the covering radius of optimum codes

On the covering radius of Simplex codes

“…An upper bound on the covering radius of an optimal code is given by the following theorem, the proof of which being similar to that of the binary case is omitted [1]. The following theorem of Dudunekov helps in determining the value of b q (2, d) .…”