AN IMPROVEMENT OF THE GILBERT BOUND FOR CONSTANT WEIGHT CODES

被引：14

作者：

ERICSON, T ^{[1
]}

ZINOVIEV, VA ^{[1
]}

机构：

[1] MOSCOW INFORMAT TRANSMISS PROBLEMS INST,MOSCOW 101447,USSR

来源：

关键词：

D O I：

10.1109/TIT.1987.1057344

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：721 / 723

页数：3

共 18 条

[1]

Bassalygo L. A., 1965, PROBLEMY PEREDA I IN, V1, P41

[2] A COMPARISON OF SIGNALLING ALPHABETS [J].

GILBERT, EN .

BELL SYSTEM TECHNICAL JOURNAL, 1952, 31 (03) :504-522

[3]

Goppa V.D., 1981, SOV MATH DOKL, V24, P170

[4] LOWER BOUNDS FOR CONSTANT WEIGHT CODES [J].

GRAHAM, RL ;

SLOANE, NJA .

[5]

JOHNSON A G, 1972, Animal Blood Groups and Biochemical Genetics, V3, P109

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

JOHNSON, SM .

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

[7]

Katsman G. L., 1984, IEEE Transactions on Information Theory, VIT-30, P353, DOI 10.1109/TIT.1984.1056879

[8] NONRANDOM BINARY SUPERIMPOSED CODES [J].

KAUTZ, WH ;

SINGLETON, RC .

[9]

Levenshtein V. I., 1971, PROBL PERED INFORM, V7, P3

[10]

LEVENSHTEIN VI, 1975, PROBL PEREDACH INFOR, V10, P26