Abstract
A code \(C\subseteq {Z^{n}_{2}}\) , where Z 2 = {0,1}, is said to be a binary μ-fold R-covering code, if for any word \(v \in Z^n_2\) there are at least μ distinct codewords \(c \in C\) which differ from v in at most R coordinates. The size of the smallest binary μ-fold R-covering code of length n is denoted by K(n, R, μ). In this paper we use integer programming and exhaustive search to improve 57 lower bounds on K(n, R, μ) for 6 ≤ n ≤ 16, 1 ≤ R ≤ 4 and 2 ≤ μ ≤ 4.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cohen G, Honkala I, Litsyn S and Lobstein A (1997). Covering codes. North-Holland, Amsterdam
Hämäläinen H, Honkala I, Kaikkonen M and Litsyn S (1993). Bounds for binary multiple covering codes. Des Codes Cryptogr 3: 251–275
McKay BD (1990) Nauty user’s guide (version 1.5), Computer Science Department, Australian National University, Tech. Report TR-CS-90-02
Östergård PRJ and Seuranen EA (2006). Unidirectional covering codes. IEEE Trans Inform Theory 52: 336–340
GLPK (GNU Linear Programming Kit) [electronic], available at <URL: http://www.gnu.org/software /glpk/>
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: J.D. Key.
Rights and permissions
About this article
Cite this article
Seuranen, E.A. New lower bounds for multiple coverings. Des. Codes Cryptogr. 45, 91–94 (2007). https://doi.org/10.1007/s10623-007-9089-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-007-9089-y