On constant-composition codes over Z/sub q/
From MaRDI portal
Recommendations
Cited in
(35)- A class of optimal constant composition codes from GDRPs
- Optimal FHSs and DSSs via near zero-difference balanced functions
- A generic method to construct zero-difference balanced functions
- Several classes of linear codes with a few weights from defining sets over \(\mathbb {F}_p+u\mathbb {F}_p\)
- Frame difference families and resolvable balanced incomplete block designs
- Constant composition codes as subcodes of linear codes
- Equidistant permutation group codes
- A class of linear codes with their complete weight enumerators over finite fields
- Three classes of partitioned difference families and their optimal constant composition codes
- On the constructions of constant-composition codes from perfect nonlinear functions
- Compositional restricted multiple access channel
- Zero-difference balanced functions with applications
- A new construction of zero-difference balanced functions and two applications
- 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
- Some new constructions for generalized zero-difference balanced functions
- Complete weight enumerators of some linear codes and their applications
- On Various Parameters of Z_q-Simplex codes for an even integer q
- The PBD-Closure of Constant-Composition Codes
- A Construction for Constant-Composition Codes
- Optimal ternary constant-composition codes with weight four and distance six
- A construction and bounds of constant composition codes
- Complete weight enumerators of some irreducible cyclic codes
- Generic constructions for partitioned difference families with applications: a unified combinatorial approach
- scientific article; zbMATH DE number 2235051 (Why is no real title available?)
- scientific article; zbMATH DE number 7688182 (Why is no real title available?)
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Complete weight enumerators of quasi-2-dimensional cyclic codes
- 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}\)
This page was built for publication: On constant-composition codes over Z/sub q/
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547310)
