Covering schemes of strength \(t\)
DOI10.1007/s10623-023-01252-2zbMath1526.05113OpenAlexW4381611201MaRDI QIDQ6063132
Anderson Novaes Martinhão, Otávio J. N. T. N. dos Santos, André Guerino Castoldi, Emerson L. Monte Carmelo
Publication date: 7 November 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-023-01252-2
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on difference matrices over non-cyclic finite abelian groups
- On the construction of asymmetrical orthogonal arrays
- On difference matrices and regular latin squares
- Orthogonal arrays. Theory and applications
- On difference schemes and orthogonal arrays of strength \(t\)
- Constructions of difference covering arrays.
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Generalized Bhaskar Rao designs and dihedral groups
- A note on a pair of orthogonal orthomorphisms of cyclic groups
- Invariant codes, difference schemes, and distributive quasigroups
- Difference matrices with five rows over finite abelian groups
- Cyclic difference packing and covering arrays.
- On (\(g\), 4; 1)-difference matrices
- Difference covering arrays and pseudo-orthogonal Latin squares
- $(m\kern -1pt,n\kern -1pt,3\kern -1pt,1)$ Optical Orthogonal Signature Pattern Codes With Maximum Possible Size
- On the state of strength-three covering arrays
- On Orthogonal Arrays
- A note on finite abelian groups
- Orthogonal Arrays of Strength two and three
- On the Problem of Construction of Orthogonal Arrays
This page was built for publication: Covering schemes of strength \(t\)
