Asymptotic Size of Covering Arrays: An Application of Entropy Compression

DOI10.1002/jcd.21553zbMath1370.05033arXiv1503.08876OpenAlexW2562106824MaRDI QIDQ5349280

Nevena Francetić, Brett Stevens

Publication date: 24 August 2017

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08876

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)

Related Items (8)

On a combinatorial framework for fault characterization ⋮ Moser-Tardos resampling algorithm, entropy compression method and the subset gas ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ The Lovász local lemma and variable strength covering arrays ⋮ Entropy compression versus Lovász local lemma ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma ⋮ Upper Bounds on the Size of Covering Arrays

This page was built for publication: Asymptotic Size of Covering Arrays: An Application of Entropy Compression