FURTHER RESULTS ON THE COVERING RADIUS OF CODES

被引：103

作者：

COHEN, GD ^{[1
]}

LOBSTEIN, AC ^{[1
]}

SLOANE, NJA ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1986年 / 32卷 / 05期

关键词：

D O I：

10.1109/TIT.1986.1057227

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：680 / 694

页数：15

共 37 条

[1]

Berger T., 2003, WILEY ENCY TELECOMMU

[2] BINARY-CODES WITH A MINIMUM DISTANCE OF 4 [J].

BEST, MR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (06) :738-742

[3] GOOD COVERINGS OF HAMMING-SPACES WITH SPHERES [J].

COHEN, G ;

FRANKL, P .

DISCRETE MATHEMATICS, 1985, 56 (2-3) :125-131

[4] A NONCONSTRUCTIVE UPPER BOUND ON COVERING RADIUS [J].

COHEN, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :352-353

[5] 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

[6]

COHEN GD, 1986, UNPUB 1984 P INT C A

[7]

DICKSON TJ, 1971, J LOND MATH SOC, V3, P222

[8] THE FOOTBALL POOL PROBLEM FOR 7-MATCHES AND 8-MATCHES [J].

FERNANDES, H ;

RECHTSCHAFFEN, E .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 35 (01) :109-114

[9]

GOBLICK TJ, 1962, THESIS MASS I TECHNO

[10] ON THE COVERING RADIUS OF CODES [J].

GRAHAM, RL ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :385-401

← 1 2 3 4 →