Combinatorial Constructions of Optimal Constant-Composition Codes
From MaRDI portal
Publication:3546803
DOI10.1109/TIT.2005.855612zbMath1181.94128OpenAlexW2144781364MaRDI QIDQ3546803
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.855612
Related Items (32)
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 ⋮ Partitioned difference families and harmonious linear spaces ⋮ The preimage distributions of a class of zero-difference balanced functions and their partitioned difference families ⋮ Partitioned difference families: the storm has not yet passed ⋮ Partitioned difference families and almost difference sets ⋮ 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 ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ 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 ⋮ On disjoint \((v,k,k-1)\) difference families ⋮ 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 ⋮ Perfect difference systems of sets and the unit group of \(Z_{p^n}\) ⋮ Frame difference families and resolvable balanced incomplete block designs ⋮ Generalized balanced tournament designs and related codes ⋮ A class of optimal constant composition codes from GDRPs ⋮ Hadamard partitioned difference families and their descendants ⋮ A new construction of zero-difference balanced functions and two applications ⋮ Partitioned difference families versus zero-difference balanced functions ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications ⋮ Doubly resolvable canonical Kirkman packing designs and its applications ⋮ Equidistant permutation group codes ⋮ Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\) ⋮ Optimal almost equisymbol codes based on difference matrices
This page was built for publication: Combinatorial Constructions of Optimal Constant-Composition Codes
