A classification of invariant sets of constant-weight tuples and applications to covering schemes
Covering schemes were recently introduced as a generalization of both difference matrices and difference schemes, providing an efficient method for building covering arrays with a certain degree of symmetry. On the other hand, Tang and Woo (1983) showed that sets of constant-weight tuples yield several upper bounds on covering arrays. However, these sets usually do not have enough symmetry to induce good covering schemes. In this work, we derive a classification of invariant sets of constant-weight tuples under the action of the diagonal group of $$\mathbb {Z}_q^k$$ . This classification enables us to obtain new upper bounds on covering scheme numbers, including the exact class for binary covering scheme numbers with k columns and strength $$k-2.$$
Authors
- André Guerino Castoldi (ORCID: https://orcid.org/0000-0002-8601-4715)
- Emerson L. Monte Carmelo (ORCID: https://orcid.org/0000-0002-5390-6901)
- Pablo H. Perondi (ORCID: https://orcid.org/0000-0002-7446-4647)
- Anderson N. Martinhão (ORCID: https://orcid.org/0000-0003-0063-8605)
- Otávio J. N. T. N. dos Santos (ORCID: https://orcid.org/0000-0001-6489-1496)
Institutions
- Universidade Estadual de Maringá (BR)
- Universidade Tecnológica Federal do Paraná (BR)
- Universidade Federal da Grande Dourados (BR)
- Universidade Estadual de Mato Grosso do Sul (BR)
Publication Details
- Journal
- Cryptography and Communications
- Published
- 2026-04-27
- DOI
- https://doi.org/10.1007/s12095-026-00890-2
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Universidade Estadual de Maringá