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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A classification of invariant sets of constant-weight tuples and applications to covering schemes

André Guerino Castoldi, Emerson L. Monte Carmelo, Pablo H. Perondi, Anderson N. Martinhão et al.
Cryptography and Communications
graph theory and CDMA systems
article

A classification of invariant sets of constant-weight tuples and applications to covering schemes

André Guerino Castoldi, Emerson L. Monte Carmelo, Pablo H. Perondi, Anderson N. Martinhão, Otávio J. N. T. N. dos Santos
article en

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.$$

Cryptography and Communications
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)
Universidade Estadual de Maringá
Sustainable cities and communities
Openalex Percentile: Top 7%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A classification of invariant sets of constant-weight tuples and applications to covering schemes — André Guerino Castoldi, Emerson L. Monte Carmelo, et al. · Cryptography and Communications (2026) | TGRS Research Map | TGRS