A Family of Optimal Constant-Composition Codes
From MaRDI portal
Publication:3546802
DOI10.1109/TIT.2005.855609zbMath1181.94129OpenAlexW1979217465MaRDI QIDQ3546802
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
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial codes (94B25)
Related Items
Complete weight enumerators of some linear codes and their applications ⋮ Complete weight enumerator for a class of linear codes from defining sets and their applications ⋮ On a generalization of planar functions ⋮ Some Theorems on Planar Mappings ⋮ Planarity of mappings \(x(\mathrm{Tr}(x)-\frac{\alpha}{2}x)\) on finite fields ⋮ Room squares with super-simple property ⋮ Another class of perfect nonlinear polynomial functions ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ New pseudo-planar binomials in characteristic two and related schemes ⋮ Planarity of products of two linearized polynomials ⋮ Constant composition codes as subcodes of linear codes ⋮ On the constructions of constant-composition codes from perfect nonlinear functions ⋮ New families of perfect nonlinear polynomial functions ⋮ Uniqueness of \(\mathbb{F}_q\)-quadratic perfect nonlinear maps from \(\mathbb{F}_{q^3}\) to \(\mathbb{F}_q^2\) ⋮ A family of planar binomials in characteristic 2 ⋮ A new construction of zero-difference balanced functions and two applications ⋮ Planar polynomials arising from linearized polynomials
