Small arrays of maximum coverage

DOI10.1002/JCD.21609MaRDI QIDQ4556030zbMATH OpenOpenAlexWikidataFDO

Authors Shagnik Das, Tamás Mészáros

Publication date 23 November 2018

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

Full work available at URL https://doi.org/10.1002/jcd.21609

zbMATH Keywords

covering arraysdesign theoryextremal combinatoricshypergraph Lagrangians

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Hypergraphs (05C65)

Recommendations

• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering array bounds using analytical techniques
• Covering arrays of strength three

Cited in

(9)

• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays for some equivalence classes of words
• Covering array bounds using analytical techniques
• Asymptotic size of covering arrays: an application of entropy compression
• t-covering arrays generated by a tiling probability model
• Detecting arrays for effects of multiple interacting factors
• Maximum shattering
• Covering and radius-covering arrays: constructions and classification

This page was built for publication: Small arrays of maximum coverage

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556030)