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

2014/01/16 by Yeow Meng Chee, Chee, Yeow Meng, Fei Gao +10
Computer Science · Mathematics · #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1401.3925

openalex publication_date 2014/01/16 · arxiv created 2014/01/19 · arxiv updated 2014/01/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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.

Related

• Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
• Constant composition codes derived from linear codes
• Linear Size Constant-Composition Codes Meeting the Johnson Bound
• Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
• New bounds and constructions for multiply constant-weight codes