On the constructions of constant-weight codes

被引：41

作者：

Fu, FW ^{[1
]}

Vinck, AJH

Shen, SY

机构：

[1] Univ Essen Gesamthsch, Inst Expt Math, D-4300 Essen, Germany

[2] Nankai Univ, Dept Math, Tianjin 300071, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1998年 / 44卷 / 01期

关键词：

constant-weight codes; Johnson bound; Plotkin bound; simplex codes;

D O I：

10.1109/18.651060

中图分类号：

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

学科分类号：

0812 ;

摘要：

Two methods of constructing binary constant-weight codes from 1) codes over GF(q) and 2) constant-weight codes over GF(q) are presented. Several classes of binary optimum constant-weight codes are derived from these methods. in general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, can be constructed from optimum codes over CF(q) which achieve the Plotkin bound. Finally, several classes of optimum constant-weight codes over GF(q) are constructed.

引用

页码：328 / 333

页数：6

共 15 条

[1] DC-CONSTRAINED CODES FROM HADAMARD-MATRICES [J].

BARG, AM ;

LITSYN, SN .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1991, 37 (03) :801-807

[2]

Brouwer A. E., 1990, IEEE T INFORM THEORY, V36, P1344

[3]

ERICSON T, 1987, IEEE T INFORM THEORY, V33, P720

[4]

ERICSON T, 1989, LECT NOTES CONTROL I, V128, pCH2

[5]

ETZION T, 1997, IN PRESS DISCR MATH

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

JOHNSON, SM .

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

[7]

MACKENZIE C, 1984, ARS COMBINATORIA A, V17, P251

[8]

MACWILLIAMS FJ, 1981, THEORY ERROR CORRECT

[9] CONSTRUCTIONS OF BINARY CONSTANT-WEIGHT CYCLIC CODES AND CYCLICALLY PERMUTABLE CODES [J].

NGUYEN, QA ;

GYORFI, L ;

MASSEY, JL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (03) :940-949

[10]

PHELPS K, IN PRESS J COMB DES

← 1 2 →