A family of optimal constant-composition codes

被引：41

作者：

Ding, CS ^{[1
]}

Yuan, J ^{[1
]}

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2005年 / 51卷 / 10期

关键词：

constant-composition codes; constant-weight codes; perfect nonlinear functions; skew Hadamard difference sets;

D O I：

10.1109/TIT.2005.855609

中图分类号：

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

学科分类号：

0812 ;

摘要：

Constant-composition codes are a special class of constant-weight codes with very strong constraints. It is hard to construct optimal constant-composition codes. There are only a few classes of such optimal codes in the literature. In this correspondence, a family of optimal ternary constant-composition codes is constructed from a class of newly discovered perfect nonlinear functions. This class of codes is related to a new family of skew Hadamard difference sets which are the only examples of such difference sets discovered in the last seventy years.

引用

页码：3668 / 3671

页数：4

共 7 条

[1] Highly nonlinear mappings [J].

Carlet, C ;

Ding, CS .

JOURNAL OF COMPLEXITY, 2004, 20 (2-3) :205-244

[2] Planar Functions and Planes of Lenz-Barlotti Class II [J].

Coulter R.S. ;

Matthews R.W. .

Designs, Codes and Cryptography, 1997, 10 (2) :167-184

[3]

DING C, IN PRESS J COMB TH A

[4]

LIDL R, 1997, FINITE FIELDS

[5] On constant-composition codes over Zq [J].

Luo, Y ;

Fu, FW ;

Vinck, AJH ;

Chen, W .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (11) :3010-3016

[6] Bounds and constructions for ternary constant-composition codes [J].

Svanström, M ;

Östergård, PRJ ;

Bogdanova, GT .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2002, 48 (01) :101-111

[7] Constructions of ternary constant-composition codes with weight three [J].

Svanström, M .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2000, 46 (07) :2644-2647

← 1 →