A Family of Optimal Constant-Composition Codes
From MaRDI portal
Publication:3546802
DOI10.1109/TIT.2005.855609zbMATH Open1181.94129OpenAlexW1979217465MaRDI QIDQ3546802FDOQ3546802
Authors: Cunsheng Ding, Jin Yuan 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.855609
Recommendations
- Combinatorial Constructions of Optimal Constant-Composition Codes
- A construction of optimal constant composition codes
- A Construction for Constant-Composition Codes
- Constructions of a class of optimal constant composition codes
- Algebraic Constructions of Constant Composition Codes
- A construction and bounds of constant composition codes
- A New Construction for Constant-Composition Codes
- On constant composition codes
- A new combinatorial approach to the construction of constant composition codes
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)
Cited In (21)
- Algebraic Constructions of Constant Composition Codes
- Planar polynomials arising from linearized polynomials
- Room squares with super-simple property
- Constant composition codes as subcodes of linear codes
- On the constructions of constant-composition codes from perfect nonlinear functions
- Uniqueness of \(\mathbb{F}_q\)-quadratic perfect nonlinear maps from \(\mathbb{F}_{q^3}\) to \(\mathbb{F}_q^2\)
- Complete weight enumerators of some linear codes and their applications
- On a generalization of planar functions
- A new construction of zero-difference balanced functions and two applications
- A class of optimal constant composition codes from GDRPs
- New families of perfect nonlinear polynomial functions
- Another class of perfect nonlinear polynomial functions
- New pseudo-planar binomials in characteristic two and related schemes
- Planarity of products of two linearized polynomials
- Optimal ternary constant-composition codes with weight four and distance six
- Some Theorems on Planar Mappings
- Optimal Constant Composition Codes From Zero-Difference Balanced Functions
- A new combinatorial approach to the construction of constant composition codes
- Planarity of mappings \(x(\mathrm{Tr}(x)-\frac{\alpha}{2}x)\) on finite fields
- A family of planar binomials in characteristic 2
- Complete weight enumerator for a class of linear codes from defining sets and their applications
This page was built for publication: A Family of Optimal Constant-Composition Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546802)
