On constant-composition codes over Z/sub q/
From MaRDI portal
Publication:3547310
DOI10.1109/TIT.2003.819339zbMath1181.94132OpenAlexW1967583477MaRDI QIDQ3547310
Yuan Luo, Wende Chen, Fang-Wei Fu, A. J. Han Vinck
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.2003.819339
lower bound for maximum size of \(q\)-ary constant-composition codesminimum distance at least 3optimum constant-composition codes
Related Items (26)
A class of linear codes with their complete weight enumerators over finite fields ⋮ Complete weight enumerators of some linear codes and their applications ⋮ Equidistant frequency permutation arrays and related constant composition codes ⋮ A construction of optimal constant composition codes ⋮ Three classes of partitioned difference families and their optimal constant composition codes ⋮ Optimal FHSs and DSSs via near zero-difference balanced functions ⋮ Complete weight enumerator for a class of linear codes from defining sets and their applications ⋮ A generic method to construct zero-difference balanced functions ⋮ Sets of zero-difference balanced functions and their applications ⋮ Some New Constructions for Generalized Zero-Difference Balanced Functions ⋮ Unnamed Item ⋮ Room squares with super-simple property ⋮ A new combinatorial approach to the construction of constant composition codes ⋮ Constructions of partitioned difference families ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Complete weight enumerators of some irreducible cyclic codes ⋮ Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\) ⋮ Generic constructions for partitioned difference families with applications: a unified combinatorial approach ⋮ Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\) ⋮ Constant composition codes as subcodes of linear codes ⋮ On the constructions of constant-composition codes from perfect nonlinear functions ⋮ Frame difference families and resolvable balanced incomplete block designs ⋮ A class of optimal constant composition codes from GDRPs ⋮ Zero-difference balanced functions with applications ⋮ A new construction of zero-difference balanced functions and two applications ⋮ Equidistant permutation group codes
This page was built for publication: On constant-composition codes over Z/sub q/
