A Construction for Constant-Composition Codes
A Construction for Constant-Composition Codes
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 <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</i> =3 this construction gives a lower bound of constant-composition codes improving the one by Luo (2003) for some case. Moreover, for …