New upper bounds for binary covering codes
The authors consider upper bounds on \(K(n,r)\), the minimum cardinality of a binary code of length \(n\) and covering radius \(r\). Such bounds are obtained by constructing a corresponding covering code. The methods discussed are both combinatorial and based on computer search. The authors give an updated table of upper bounds on \(K(n,r)\), \(n\leq 64\), \(r\leq 12\).
scientific article; zbMATH DE number 1110090
scientific article