IMPROVED SPHERE BOUNDS ON THE COVERING RADIUS OF CODES

被引：57

作者：

VANWEE, GJM

机构：

[1] Eindhoven Univ of Technology, Neth, Eindhoven Univ of Technology, Neth

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1988年 / 34卷 / 02期

关键词：

D O I：

10.1109/18.2632

中图分类号：

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

学科分类号：

0812 ;

摘要：

CODES, SYMBOLIC

引用

页码：237 / 245

页数：9

共 29 条

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

BEST, MR .

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

[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, 1986, 1984 P INT C ALG ALG

[5]

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

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

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

GRAHAM, RL ;

SLOANE, NJA .

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

[8]

Kalbfleisch J. G., 1971, Journal of Combinatorial Theory, Series A, V11, P233, DOI 10.1016/0097-3165(71)90051-3

[9]

KALBFLEISCH JG, 1969, J LONDON MATH SOC, V1, P398

[10]

KALBFLEISCH JG, 1969, J LOND MATH SOC, V44, P60

← 1 2 3 →