TY - JOUR
T1 - Bounds for binary multiple covering codes
AU - Hämäläinen, Heikki O.
AU - Honkala, Iiro S.
AU - Kaikkonen, Markku K.
AU - Litsyn, Simon N.
PY - 1993/7
Y1 - 1993/7
N2 - We study codes that are multiple coverings of the Hamming space {Mathematical expression} and discuss lower and upper bounds on K(n, r, μ), the minimum cardinality of a binary code of length n such that the Hamming spheres of radius r centered at the codewords cover {Mathematical expression} at least μ times. We also study the similar problem of multiple coverings containing repeated words. A table of bounds for n≤16, r≤4, μ≤4 is given.
AB - We study codes that are multiple coverings of the Hamming space {Mathematical expression} and discuss lower and upper bounds on K(n, r, μ), the minimum cardinality of a binary code of length n such that the Hamming spheres of radius r centered at the codewords cover {Mathematical expression} at least μ times. We also study the similar problem of multiple coverings containing repeated words. A table of bounds for n≤16, r≤4, μ≤4 is given.
KW - binary codes
KW - multiple coverings
UR - http://www.scopus.com/inward/record.url?scp=0011566837&partnerID=8YFLogxK
U2 - 10.1007/BF01388486
DO - 10.1007/BF01388486
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0011566837
VL - 3
SP - 251
EP - 275
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
SN - 0925-1022
IS - 3
ER -