Two Classes of Optimal Constant Composition Codes from Zero Difference Balanced Functions

Bing LIU  Xia LI  Feng CHENG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A    No.10    pp.2183-2186
Publication Date: 2017/10/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.2183
Type of Manuscript: LETTER
Category: Coding Theory
constant composition codes,  zero difference balanced functions,  constant-weight codes,  Luo-Fu-Vinck-Chen bound,  

Full Text: PDF(262.9KB)>>
Buy this Article

Constant composition codes (CCCs) are a special class of constant-weight codes. They include permutation codes as a subclass. The study and constructions of CCCs with parameters meeting certain bounds have been an interesting research subject in coding theory. A bridge from zero difference balanced (ZDB) functions to CCCs with parameters meeting the Luo-Fu-Vinck-Chen bound has been established by Ding (IEEE Trans. Information Theory 54(12) (2008) 5766-5770). This provides a new approach for obtaining optimal CCCs. The objective of this letter is to construct two classes of ZDB functions whose parameters not covered in the literature, and then obtain two classes of optimal CCCs meeting the Luo-Fu-Vinck-Chen bound from these new ZDB functions.