A New Construction for Constant-Composition Codes
Xin Wang · IEEE Transactions on Information Theory · 2021
Constant-composition codes are a subclass of constant weight codes. When$d\geq 4$, the problem of determining the maximum size of a constant-composition code for general parameters is much less understood. In this correspondence, we give a new construction for constant-composition codes with techniques in additive number theory. Moreover, we provide a new connection between constant-composition codes and linear block codes with certain properties. It turns out that when$d\geq 4$our new lower bounds improve the one by Ding (2008) substantially.