New upper bounds for binary covering codes Original Research Article

Improved upper bounds are presented for K(n, r), the minimum cardinality of a binary code of length n and covering radius r. The new bounds are obtained by both new and old constructions; in many of these, computer search using simulated annealing and tabu search plays a central role. Some new linear covering codes are also presented. An updated table of upper bounds on K(n, r), n ⩽ 64, r ⩽ 12, is given.