Abstract
A constant composition code is a special constant weight code under the restriction that each symbol should appear a given number of times in each codeword. In this paper, we give an asymptotically optimal lower bound for the maximum size of the q-ary constant composition codes with minimum distance at least 3. In addition, a number of optimum constant composition codes are obtained by using three constructions.
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.
