BINARY-CODES WITH A MINIMUM DISTANCE OF 4

被引：43

作者：

BEST, MR ^{[1
]}

机构：

[1] MATH CENTRUM,NL-1005 AMSTERDAM,NETHERLANDS

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1980年 / 26卷 / 06期

关键词：

D O I：

10.1109/TIT.1980.1056269

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：738 / 742

页数：5

共 14 条

[1] TRIPLY SHORTENED BINARY HAMMING CODE IS OPTIMAL [J].

BEST, MR ;

BROUWER, AE .

DISCRETE MATHEMATICS, 1977, 17 (03) :235-245

[2] BOUNDS FOR BINARY CODES OF LENGTH LESS THAN 25 [J].

BEST, MR ;

BROUWER, AE ;

MACWILLIAMS, FJ ;

ODLYZKO, AM ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1978, 24 (01) :81-92

[3]

BEST MR, 1978, ZW112 MATH CTR REP

[4]

BEST MR, 1977, ZN7177 MATH CTR REP

[5]

DELSARTE P, 1972, PHILIPS RES REP, V27, P272

[6]

GOLAY MJE, 1954, IRE T INFORMATI PGIT, V4, P23

[7] A NEW UPPER BOUND FOR ERROR-CORRECTING CODES [J].

JOHNSON, SM .

IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (03) :203-207

[8] 2 IMPROVED BLOCK-CODES [J].

JULIN, D .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1965, 11 (03) :459-459

[9] MAXIMAL AND MINIMAL COVERINGS OF (K-I)-TUPLES BY K-TUPLES [J].

KALBFLEISCH, JG ;

STANTON, RG .

PACIFIC JOURNAL OF MATHEMATICS, 1968, 26 (01) :131-+

[10] SPHERE PACKINGS AND ERROR-CORRECTING CODES [J].

LEECH, J ;

SLOANE, NJA .

CANADIAN JOURNAL OF MATHEMATICS, 1971, 23 (04) :718-&

← 1 2 →