A classification of invariant sets of constant-weight tuples and applications to covering schemes
Abstract
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.$$
Fields of Study & Subjects
graph theory and CDMA systems
Finite Group Theory Research
Coding theory and cryptography
Publication details
- Journal / source
- Cryptography and Communications
- Publisher
- Springer Science and Business Media LLC
- Volume
- 18
- Issue
- 4
- Pages
- 1429–1446
- Publication date
- 27 April 2026
- Language
- EN