SHORT CODES WITH A GIVEN COVERING RADIUS

被引：41

作者：

BRUALDI, RA

PLESS, VS

WILSON, RM

机构：

[1] UNIV ILLINOIS,DEPT MATH,CHICAGO,IL 60680

[2] CALTECH,DEPT MATH,PASADENA,CA 91125

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1989年 / 35卷 / 01期

关键词：

D O I：

10.1109/18.42181

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：99 / 109

页数：11

共 9 条

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

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

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

GRAHAM, RL ;

SLOANE, NJA .

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

[4]

GRIESMER IH, 1960, IBM J RES DEV, V4, P532

[5]

Hirschfeld J.W.P., 1979, PROJECTIVE GEOMETRIE

[6]

JOHNSON SM, 1962, IEEE T INFORM THEORY, V4, P203

[7]

LOGACEV VN, 1974, OPTIMIZATION METHODS, P107

[8]

Macwilliams F., 1986, THEORY ERROR CORRECT

[9]

VANTILBORG HCA, 1981, DISCRETE MATH, V33, P197, DOI 10.1016/0012-365X(81)90166-7

← 1 →