A Construction for Constant-Composition Codes
From MaRDI portal
Publication:3604774
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.
Recommendations
Cited in
(13)- Construction of constant composition codes based on cyclic codes
- On the Construction of (Explicit) Khodak's Code and Its Analysis
- A Family of Optimal Constant-Composition Codes
- On constant-composition codes over Z/sub q/
- scientific article; zbMATH DE number 218228 (Why is no real title available?)
- A construction of optimal constant composition codes
- Room squares with super-simple property
- Complete weight enumerators of some linear codes and their applications
- A construction and bounds of constant composition codes
- Optimal ternary constant-composition codes with weight four and distance six
- Approximate generalized Steiner systems and near-optimal constant weight codes
- A new combinatorial approach to the construction of constant composition codes
- A New Construction for 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)
