Graham, R. L.; Sloane, N. J. A. On the covering radius of codes. (English) Zbl 0585.94012 IEEE Trans. Inf. Theory 31, 385-401 (1985). A number of new results for the minimum covering radius of any binary code of a given length and dimension are given. The minimum covering radius for codes of dimension 4 or 5 is determined exactly, and tight bounds are obtained for any dimension when the code length is large. The paper contains a table with the known bounds for codes of length up to 64, and a list of open problems. Reviewer: Vl.Tonchev Cited in 2 ReviewsCited in 40 Documents MSC: 94B05 Linear codes (general theory) Keywords:minimum covering radius; binary code PDFBibTeX XMLCite \textit{R. L. Graham} and \textit{N. J. A. Sloane}, IEEE Trans. Inf. Theory 31, 385--401 (1985; Zbl 0585.94012) Full Text: DOI Online Encyclopedia of Integer Sequences: Triangle T(n,k) (1 <= k <= n) giving smallest covering radius of any [n,k] binary linear code.