A Construction for Constant-Composition Codes
Yang Ding · IEEE Transactions on Information Theory · 2008
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 whend=3 this construction gives a lower bound of constant-composition codes improving the one by Luo (2003) for some case. Moreover, ford> 3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound ford=5 gives the best possible size of constant-composition codes up to magnitude.