Combinatorial Constructions of Optimal Constant-Composition Codes
From MaRDI portal
Recommendations
- A class of optimal constant composition codes from GDRPs
- Constructions of a class of optimal constant composition codes
- A new combinatorial approach to the construction of constant composition codes
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- A construction of optimal constant composition codes
Cited in
(42)- Generalized balanced tournament designs and related codes
- A class of optimal constant composition codes from GDRPs
- Optimal FHSs and DSSs via near zero-difference balanced functions
- Optimal ternary constant-composition codes with weight four and distance three
- Frame difference families and resolvable balanced incomplete block designs
- Constant composition codes as subcodes of linear codes
- Equidistant permutation group codes
- Three classes of partitioned difference families and their optimal constant composition codes
- 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
- Doubly resolvable canonical Kirkman packing designs and its applications
- Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\)
- Optimal almost equisymbol codes based on difference matrices
- Complete weight enumerator for a class of linear codes from defining sets and their applications
- Sets of zero-difference balanced functions and their applications
- Room squares with super-simple property
- On constant composition codes
- Construction of minimum bandwidth regenerating codes with combinatorial design
- Some new constructions for generalized zero-difference balanced functions
- Algebraic Constructions of Constant Composition Codes
- A Family of Optimal Constant-Composition Codes
- The PBD-Closure of Constant-Composition Codes
- Constructions of a class of optimal constant composition codes
- Optimal ternary constant-composition codes with weight four and distance six
- A New Construction for Constant-Composition Codes
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
- scientific article; zbMATH DE number 7688182 (Why is no real title available?)
- 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
- Approximate generalized Steiner systems and near-optimal constant weight codes
- On disjoint \((v,k,k-1)\) difference families
- Constructions of quintuple constant-composition codes with weight four and distance three
- Equidistant frequency permutation arrays and related constant composition codes
- A construction of optimal constant composition codes
- A new combinatorial approach to the construction of constant composition codes
- Constructions of partitioned difference families
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Perfect difference systems of sets and the unit group of \(Z_{p^n}\)
This page was built for publication: Combinatorial Constructions of Optimal Constant-Composition Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546803)
