A Construction for Constant-Composition Codes
From MaRDI portal
Publication:3604774
DOI10.1109/TIT.2008.926380zbMATH Open1181.94130arXiv0802.1815OpenAlexW2155667204MaRDI QIDQ3604774FDOQ3604774
Authors: Yang Ding 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of constant-composition codes improving the one in [10]. Moreover, for d>3, we give a lower bound on maximal size of constant-composition codes. In particular, our bound for d=5 gives the best possible size of constant-composition codes up to magnitude.
Full work available at URL: https://arxiv.org/abs/0802.1815
Recommendations
Cited In (13)
- Construction of constant composition codes based on cyclic codes
- Title not available (Why is that?)
- A Family of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- Room squares with super-simple property
- Complete weight enumerators of some linear codes and their applications
- A construction of optimal constant composition codes
- Approximate generalized Steiner systems and near-optimal constant weight codes
- A New Construction for Constant-Composition Codes
- Optimal ternary constant-composition codes with weight four and distance six
- A new combinatorial approach to the construction of constant composition codes
- On the Construction of (Explicit) Khodak's Code and Its Analysis
- A construction and bounds of constant composition codes
This page was built for publication: A Construction for Constant-Composition Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604774)
