Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families

Yeow Meng Chee; Fei Gao; Han Mao Kiah; Alan Chi Hung Ling; Hui Zhang; Xiande Zhang; IEEE

Back

Conference proceeding

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families

Yeow Meng Chee, Fei Gao, Han Mao Kiah, Alan Chi Hung Ling, Hui Zhang, Xiande Zhang and IEEE

2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.1436-1440

IEEE International Symposium on Information Theory

01/01/2014

Abstract

Computer Science

Computer Science, Theory & Methods

Engineering

Engineering, Electrical & Electronic

Science & Technology

Technology

We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an interesting application of the theory of decomposition of edge-colored digraphs.

Metrics

1 Record Views

Details

Title: Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
Creators - without role: Yeow Meng Chee - Supreme Council Of Health
Fei Gao
Han Mao Kiah
Alan Chi Hung Ling
Hui Zhang - Supreme Council Of Health
Xiande Zhang - Supreme Council Of Health
IEEE
Publication Details: 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), pp.1436-1440
Series: IEEE International Symposium on Information Theory
Publisher: IEEE
Number of pages: 5
Identifiers: 9911181009846
Academic Unit: ISTD Pillar; ESD Pillar; Office of Provost
Language: English
Resource Type: Conference proceeding

Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families

Abstract

Metrics

Details

Singapore University of Technology and Design Social media