Bounds on mixed binary/ternary codes

被引：59

作者：

Brouwer, AE

Hamalainen, HO

Ostergard, PRJ

Sloane, NJA

机构：

[1] Eindhoven Univ Technol, Dept Math, NL-5600 MB Eindhoven, Netherlands

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

[3] AT&T Bell Labs, Res, Informat Sci Res Ctr, Florham Park, NJ 07932 USA

来源：

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

基金：

芬兰科学院;

关键词：

binary codes; clique finding; linear programming bound; mixed codes; tabu search; ternary codes;

D O I：

10.1109/18.651001

中图分类号：

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

学科分类号：

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

摘要：

Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included, The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.

引用

页码：140 / 161

页数：22

共 43 条

[1]

APPLEGATE D, 1993, COMMUNICATION

[2]

TRIPLY SHORTENED BINARY HAMMING CODE IS OPTIMAL [J].