Constructions of ternary constant-composition codes with weight three
From MaRDI portal
Recommendations
Cited in
(17)- Optimal grid holey packings with block size 3 and 4
- Optimal ternary constant-composition codes with weight four and distance three
- Ternary constant weight codes
- On the constructions of constant-composition codes from perfect nonlinear functions
- Enumeration of optimal ternary constant-composition codes
- Room squares with super-simple property
- A lower bound for ternary constant weight codes
- scientific article; zbMATH DE number 1498789 (Why is no real title available?)
- scientific article; zbMATH DE number 1511259 (Why is no real title available?)
- scientific article; zbMATH DE number 1522575 (Why is no real title available?)
- Bounds and constructions for ternary constant-composition codes
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Optimal ternary constant-composition codes with weight four and distance six
- Three-element codes with one \(d\)-primitive word
- Constructions of quintuple constant-composition codes with weight four and distance three
- A construction of optimal constant composition codes
- A new combinatorial approach to the construction of constant composition codes
This page was built for publication: Constructions of ternary constant-composition codes with weight three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2705994)