On Lower Bounds for Covering Codes

被引：1

作者：

Bhandari M.C. ^{[1
]}

Chanduka K.K.P. ^{[1
]}

Lal A.K. ^{[1
]}

机构：

[1] Department of Mathematics, Indian Institute of Technology, Kanpur

来源：

Designs, Codes and Cryptography | 1998年 / 15卷 / 3期

关键词：

Binary covering code; Covering radius; Sphere bound;

D O I：

10.1023/A:1008364924033

中图分类号：

学科分类号：

摘要：

We study lower bounds on K (n, R), the minimum number of codewords of any binary code of length n such that the Hamming spheres of radius R with center at codewords cover the Hamming space double-struck F signn2. We generalize Honkala's idea to obtain further improvements only by using some simple observations of Zhang's result. This leads to nineteen improvements of the lower bound on K(n, R) within the range of 1 ≤ n ≤ 33, 1 ≤ R ≤ 10.

引用

页码：237 / 243

页数：6

共 13 条

[1]

Cohen G., Honkala I.S., Litsyn S., Lobstein A., Covering Codes, (1997)

[2]

Dongfeng L., Chen W., New lower bounds for binary covering codes, IEEE Trans. Inform. Theory, 40, pp. 1122-1129, (1994)

[3]

Hamalainen H.O., Honkala I.S., Kaikkonen M.K., Litsyn S.N., Bounds for binary multiple covering codes, Designs, Codes and Cryptography, 3, pp. 251-275, (1993)

[4]

Honkala I.S., Lower bounds for binary covering codes, IEEE Trans. Inform. Theory, 34, pp. 326-329, (1988)

[5]

Honkala I.S., Modified bounds for covering codes, IEEE Trans. Inform. Theory, 37, pp. 361-365, (1991)

[6]

Hou X., New lower bounds for covering codes, IEEE Trans. Inform. Theory, 36, pp. 895-899, (1990)

[7]

Hou X., An improved sphere bounds for covering codes with n = 3R + 2, IEEE Trans. Inform. Theory, 36, pp. 1476-1478, (1990)

[8]

Johnson S.M., A new lower for coverings by rook domains, Utilitas Mathematica, 1, pp. 121-140, (1972)

[9]

MacWilliams F.J., Sloane N.J.A., The Theory of Error-Correcting Codes, 2nd. Edition, (1976)

[10]

Ostergard P.R.J., A new binary code of length 10 and covering radius 1, IEEE Trans. Inform. Theory, 37, pp. 179-180, (1991)

← 1 2 →