Constructions of difference covering arrays.
From MaRDI portal
Publication:1421336
DOI10.1016/j.jcta.2003.09.005zbMath1038.05011OpenAlexW1991243505MaRDI QIDQ1421336
Publication date: 26 January 2004
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2003.09.005
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items (12)
Difference covering arrays and pseudo-orthogonal Latin squares ⋮ Covering schemes of strength \(t\) ⋮ On Ordering Problems: A Statistical Approach ⋮ Constructions of covering arrays of strength five ⋮ Constructions of almost difference families ⋮ Constructions of new orthogonal arrays and covering arrays of strength three ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ A survey of methods for constructing covering arrays ⋮ Resolvable covering arrays ⋮ Cyclic difference packing and covering arrays. ⋮ A note on a pair of orthogonal orthomorphisms of cyclic groups ⋮ High-rate LDPC codes from partially balanced incomplete block designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a composition of cyclic 2-designs
- Difference packing arrays and systematic authentication codes
- On the existence of MOLS with equal-sized holes
- Group divisible designs with block-size four
- Lower bounds for transversal covers
- A general construction for optimal cyclic packing designs
- Constructions for optimal optical orthogonal codes
- Authentication Theory/Coding Theory
- Partial λ-Geometries and Generalized Hadamard Matrices Over Groups
- Codes Which Detect Deception
- Constructions for optimal (υ, 4, 1) optical orthogonal codes
- Covering arrays and intersecting codes
- Compressing inconsistent data
This page was built for publication: Constructions of difference covering arrays.
