Constructions of q-Ary Constant-Weight Codes
arXiv:0705.0081 · doi:10.1109/TIT.2006.887499
Abstract
This paper introduces a new combinatorial construction for q-ary constant-weight codes which yields several families of optimal codes and asymptotically optimal codes. The construction reveals intimate connection between q-ary constant-weight codes and sets of pairwise disjoint combinatorial designs of various types.
12 pages
Cited by in corpus (11)
- Linear Size Optimal q-ary Constant-Weight Codes and Constant-Composition Codes
- The Sizes of Optimal q-Ary Codes of Weight Three and Distance Four: A Complete Solution
- A family of diameter perfect constant-weight codes from Steiner systems
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families
- SCW Codes for Maximum Likelihood Detection in Diffusive Molecular Communications without Channel State Information
- A Pair of Disjoint 3-GDDs of type g^t u^1
- Constant-Weight Array Codes
- A construction of group divisible designs with zero block sum
- On Expanded Cyclic Codes
- Hypergraph encoding set systems and their linear representations
- SCW Codes for Optimal CSI-Free Detection in Diffusive Molecular Communications