Group construction of covering arrays

DOI10.1002/jcd.20035zbMath1057.05023OpenAlexW2043080690MaRDI QIDQ4651897

Karen Meagher, Brett Stevens

Publication date: 23 February 2005

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

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

zbMATH Keywords

orthogonal arraytransversal designfactorial designcovering array

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Factorial statistical designs (62K15) Combinatorial aspects of packing and covering (05B40)

Related Items (17)

Constraint models for the covering test problem ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Covering arrays on product graphs ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Improved strength four covering arrays with three symbols ⋮ Asymptotic and constructive methods for covering perfect hash families and covering arrays ⋮ Covering array EXtender ⋮ Strength two covering arrays: existence tables and projection ⋮ A two-stage algorithm for combinatorial testing ⋮ Randomized post-optimization of covering arrays ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Partial covering arrays: algorithms and asymptotics ⋮ A survey of methods for constructing covering arrays ⋮ Cover starters for covering arrays of strength two ⋮ Resolvable covering arrays ⋮ Bounds for covering codes over large alphabets ⋮ Upper Bounds on the Size of Covering Arrays

This page was built for publication: Group construction of covering arrays