A construction for constant-composition codes

被引：10

作者：

Ding, Yang ^{[1
]}

机构：

[1] SE Univ, Dept Math, Nanjing 210096, Peoples R China

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2008年 / 54卷 / 08期

关键词：

algebraic geometry codes; concatenated codes; constant-composition codes; self-orthogonal codes;

D O I：

10.1109/TIT.2008.926380

中图分类号：

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

学科分类号：

0812 ;

摘要：

By employing the residue polynomials, we give a construction of constant-composition codes. This construction generalizes the one proposed by Xing (2002). It turns out that when d = 3 this construction gives a lower bound of constant-composition codes improving the one by Luo et al. (2003) for some case. Moreover, for d > 3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound for d = 5 gives the best possible size of constant-composition codes up to magnitude.

引用

页码：3738 / 3741

页数：4

共 16 条

[11]

Milenkovic O, 2006, LECT NOTES COMPUT SC, V3969, P100

[12]

Stichtenoth H., 1993, Algebraic function fields and codes

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