A Construction for Constant-Composition Codes
Information Theory
2016-11-15 v1 math.IT
Abstract
By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of constant-composition codes improving the one in [10]. 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.
Cite
@article{arxiv.0802.1815,
title = {A Construction for Constant-Composition Codes},
author = {Yang Ding},
journal= {arXiv preprint arXiv:0802.1815},
year = {2016}
}
Comments
4 pages, submitted to IEEE Infromation Theory