COVERING RADIUS - SURVEY AND RECENT RESULTS

被引：188

作者：

COHEN, GD

KARPOVSKY, MG

MATTSON, HF

SCHATZ, JR

机构：

[1] BOSTON UNIV,COLL ENGN,BOSTON,MA 02215

[2] SYRACUSE UNIV,SCH COMP & INFORMAT SCI,SYRACUSE,NY 13210

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1985年 / 31卷 / 03期

关键词：

D O I：

10.1109/TIT.1985.1057043

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：328 / 343

页数：16

共 79 条

[1]

[Anonymous], 1976, UNIFORMLY PACKED COD

[2]

ASSMUS EF, 1974, SIAM REV, V16, P349, DOI 10.1137/1016056

[3] ON THE COVERING RADIUS OF EXTREMAL SELF-DUAL CODES [J].

ASSMUS, EF ;

PLESS, V .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :359-363

[4] INTEGER-MAKING THEOREMS [J].

BECK, J ;

FIALA, T .

DISCRETE APPLIED MATHEMATICS, 1981, 3 (01) :1-8

[5]

BERGER T, 1971, RATE DISTORITION THE

[6] WEIGHT DISTRIBUTIONS OF COSETS OF (32,6) REED-MULLER CODE [J].

BERLEKAMP, ER ;

WELCH, LR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1972, 18 (01) :203-+

[7] INHERENT INTRACTABILITY OF CERTAIN CODING PROBLEMS [J].

BERLEKAMP, ER ;

MCELIECE, RJ ;

VANTILBORG, HCA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (03) :384-386

[8]

BERLEKAMP ER, 1968, ALGEBRAIC CODING THE

[9] PERFECT CODES HARDLY EXIST [J].

BEST, MR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :349-351

[10] BOUNDS FOR EXPONENTIAL SUMS [J].

CARLITZ, L ;

UCHIYAMA, S .

DUKE MATHEMATICAL JOURNAL, 1957, 24 (01) :37-41

← 1 2 3 4 5 6 7 8 →