SOME LOWER BOUNDS FOR CONSTANT WEIGHT CODES

被引：4

作者：

HONKALA, I

HAMALAINEN, H

KAIKKONEN, M

机构：

[1] Mathematics Department, University of Turku, Turku, Finland

[2] Keskipalokka, Finland

来源：

DISCRETE APPLIED MATHEMATICS | 1987年 / 18卷 / 01期

关键词：

D O I：

10.1016/0166-218X(87)90046-1

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let A(n,d,w) denote the maximum number of codewords in any binary constant weight code of length n, minimum distance d and constant weight w. In this note we mention some improvements to the lower bounds for A(n,d,w) d less than equivalent to 10. We also mention several lower bounds for A(n,12,w).

引用

页码：95 / 98

页数：4

共 6 条

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

[2] LEXICOGRAPHIC CODES - ERROR-CORRECTING CODES FROM GAME-THEORY [J].

CONWAY, JH ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1986, 32 (03) :337-348

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

GRAHAM, RL ;

SLOANE, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (01) :37-43

[4]

Macwilliams F., 1986, THEORY ERROR CORRECT

[5]

RANKINEN SM, COMMUNICATION

[6]

VANPUL CLM, 1982, THESIS EINDHOVEN U T

← 1 →