THE UNIQUENESS OF THE BEST CODE

被引：11

作者：

LITSYN, S ^{[1
]}

VARDY, A ^{[1
]}

机构：

[1] IBM CORP,ALMADEN RES CTR,DIV RES,SAN JOSE,CA 95120

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1994年 / 40卷 / 05期

关键词：

OPTIMAL CODES; BOUNDS ON THE SIZE OF A CODE; CONSTANT-WEIGHT CODES;

D O I：

10.1109/18.333896

中图分类号：

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

学科分类号：

0812 [计算机科学与技术];

摘要：

We prove that the (10, 40, 4) code found by Best is unique. We then employ this fact to show that A(10,3) = A(11,4) less than or equal to 78 and A(11, 3) = A(12, 4) less than or equal to 156.

引用

页码：1693 / 1698

页数：6

共 12 条

[1]

ALLSTON JL, 1988, MATH COMPUT, V4, P189

[2]

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

BEST, MR .

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

[3]

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

[4]

Conway J. H., 1994, Designs, Codes and Cryptography, V4, P31, DOI 10.1007/BF01388558

[5]

Conway J. H., 1988, SPHERE PACKINGS LATT

[6]

FORNEY GD, 1993, 6TH P JOINT SWED USS, P16

[7]

EXTENDED NADLER CODE IS UNIQUE [J].

GOETHALS, JM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1977, 23 (01) :132-135

[8]

2 IMPROVED BLOCK-CODES [J].

JULIN, D .

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

[9]

Macwilliams F. J., 1977, THEORY ERROR CORRECT

[10]

Pless VS., 1968, J COMBINATORIAL THEO, V5, P215, DOI DOI 10.1016/S0021-9800(68)80067-50172.43105

← 1 2 →