Several new lower bounds on the size of codes with covering radius one

被引：9

作者：

Blass, U ^{[1
]}

Litsyn, S ^{[1
]}

机构：

[1] Tel Aviv Univ, Dept Elect Engn Syst, IL-69978 Tel Aviv, Israel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 05期

关键词：

covering codes; lower bounds;

D O I：

10.1109/18.705582

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We derive several new loner bounds on the size of binary codes with covering radius one. In particular, we prove K(9, 1) greater than or equal to 57 (the best known lower bound was 55) and K(11, 1) greater than or equal to 180 (178).

引用

页码：1998 / 2002

页数：5

共 13 条

[1]

Cohen G., 1997, COVERING CODES

[2] FURTHER RESULTS ON THE COVERING RADIUS OF CODES [J].

COHEN, GD ;

LOBSTEIN, AC ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (05) :680-694

[3] COVERING RADIUS - SURVEY AND RECENT RESULTS [J].

COHEN, GD ;

KARPOVSKY, MG ;

MATTSON, HF ;

SCHATZ, JR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :328-343

[4]

COHEN GD, 1997, APPL ALGEBR ENG COMM, V8, P67

[5] Binary codes with covering radius one: Some new lower bounds [J].

Habsieger, L .

DISCRETE MATHEMATICS, 1997, 176 (1-3) :115-130

[6] LOWER BOUNDS FOR BINARY COVERING CODES [J].

HONKALA, IS .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (02) :326-329

[7]

HONKALA IS, 1994, LECT NOTES COMPUTER, V781, P34

[8]

HONKALA IS, 1994, P INT S INF THEOR IT, V1, P39

[9]

HONKALA IS, IN PRESS ARS COMB

[10] SOME NEW LOWER BOUNDS FOR BINARY AND TERNARY COVERING CODES [J].

VANWEE, GJM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (04) :1422-1424

← 1 2 →