×

On the covering radius of codes. (English) Zbl 0585.94012

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

MSC:

94B05 Linear codes (general theory)
PDFBibTeX XMLCite
Full Text: DOI