The PBD-Closure of Constant-Composition Codes
From MaRDI portal
Abstract: We show an interesting PBD-closure result for the set of lengths of constant-composition codes whose distance and size meet certain conditions. A consequence of this PBD-closure result is that the size of optimal constant-composition codes can be determined for infinite families of parameter sets from just a single example of an optimal code. As an application, the size of several infinite families of optimal constant-composition codes are derived. In particular, the problem of determining the size of optimal constant-composition codes having distance four and weight three is solved for all lengths sufficiently large. This problem was previously unresolved for odd lengths, except for lengths seven and eleven.
Recommendations
Cited in
(7)- Generalized balanced tournament designs and related codes
- A class of optimal constant composition codes from GDRPs
- A construction of group divisible designs with block sizes 3 to 7
- Room squares with super-simple property
- Optimal ternary constant-composition codes with weight four and distance six
- scientific article; zbMATH DE number 7688182 (Why is no real title available?)
- A new combinatorial approach to the construction of constant composition codes
This page was built for publication: The PBD-Closure of Constant-Composition Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549113)
