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

Bing LIU; Xia LI; Feng CHENG

doi:10.1587/transfun.E100.A.2183

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

Bing LIU, Xia LI, Feng CHENG

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.10 pp.2183-2186

Publication Date: 2017/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E100.A.2183

Type of Manuscript: LETTER

Category: Coding Theory

Authors

Bing LIU
  Southwest Jiaotong University
Xia LI
  Southwest Jiaotong University
Feng CHENG
  Southwest Jiaotong University

Keyword

constant composition codes, zero difference balanced functions, constant-weight codes, Luo-Fu-Vinck-Chen bound

Cite this

Copy

Bing LIU, Xia LI, Feng CHENG, "Two Classes of Optimal Constant Composition Codes from Zero Difference Balanced Functions" in IEICE TRANSACTIONS on Fundamentals, vol. E100-A, no. 10, pp. 2183-2186, October 2017, doi: 10.1587/transfun.E100.A.2183.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.2183/_p

Copy

@ARTICLE{e100-a_10_2183,
author={Bing LIU, Xia LI, Feng CHENG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Two Classes of Optimal Constant Composition Codes from Zero Difference Balanced Functions},
year={2017},
volume={E100-A},
number={10},
pages={2183-2186},
abstract={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.},
keywords={},
doi={10.1587/transfun.E100.A.2183},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - Two Classes of Optimal Constant Composition Codes from Zero Difference Balanced Functions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2183
EP - 2186
AU - Bing LIU
AU - Xia LI
AU - Feng CHENG
PY - 2017
DO - 10.1587/transfun.E100.A.2183
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2017
AB - 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.
ER -