Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
arXiv:1401.3925
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.
References in corpus (5)
- Constructions of q-Ary Constant-Weight Codes
- Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
- Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
- The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution
- Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions