Bounds and constructions for ternary constant-composition codes

被引：48

作者：

Svanström, M ^{[1
]}

Östergård, PRJ

Bogdanova, GT

机构：

[1] Linkoping Univ, Dept Elect Engn, SE-58183 Linkoping, Sweden

[2] Helsinki Univ Technol, Dept Comp Sci & Engn, Espoo 02015, Finland

[3] Bulgarian Acad Sci, Inst Math & Informat, V Tarnavo 5000, Bulgaria

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 01期

基金：

芬兰科学院; 瑞典研究理事会;

关键词：

constant-weight codes; nonbinary codes; weight constraints;

D O I：

10.1109/18.971741

中图分类号：

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

学科分类号：

0812 ;

摘要：

The problem of determining the maximum size of a ternary code is considered, under the restriction that each symbol should appear a given number of times in each codeword. Upper and lower bounds on the size of such codes under Hamming metric are discussed, where the lower bounds follow from constructions of good codes. Some of the results are obtained by explicitly finding codes by computer search. A table of exact values and best known bounds on the maximum size for codes of length at most 10 is presented.

引用

页码：101 / 111

页数：11

共 17 条

[1]

Bogdanova G. T., 1998, P INT WORKSH OPT COD, P15

[2]

Bogdanova G.T., 1998, P 6 INT WORKSH ALG C, P41

[3] Bounds on mixed binary/ternary codes [J].

Brouwer, AE ;

Hamalainen, HO ;

Ostergard, PRJ ;

Sloane, NJA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :140-161

[4] A NEW TABLE OF CONSTANT WEIGHT CODES [J].

BROUWER, AE ;

SHEARER, JB ;

SLOANE, NJA ;

SMITH, WD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (06) :1334-1380

[5] THE NOISING METHOD - A NEW METHOD FOR COMBINATORIAL OPTIMIZATION [J].

CHARON, I ;

HUDRY, O .

OPERATIONS RESEARCH LETTERS, 1993, 14 (03) :133-137

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

CONWAY, JH ;

SLOANE, NJA .

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

[7] ON THE NON-EXISTENCE OF GENERALIZED HADAMARD-MATRICES [J].

DELAUNEY, W .

JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1984, 10 (03) :385-396

[8] On the constructions of constant-weight codes [J].

Fu, FW ;

Vinck, AJH ;

Shen, SY .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :328-333

[9]

Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]

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

JOHNSON, SM .

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

← 1 2 →