Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
