Abstract
Constant-composition codes (CCCs) are a generalization of constant weight codes and permutation codes. The concept of group divisible codes, an analog of group divisible designs in combinatorial design theory, was first introduced by Chee et al. This new class of codes has been shown to be useful in recursive constructions of constant-weight codes and constant-composition codes. In this paper, we consider the problem of determining the maximal sizes of ternary constant-composition codes of weight four and distance five using group divisible codes as the main tools. We determine the exact values for these parameters. The previously known results are those with code length no greater than 10.
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.
