Covering arrays with mixed alphabet sizes

DOI10.1002/JCD.10059MaRDI QIDQ4452472zbMATH OpenOpenAlexFDO

Authors

Publication date 12 February 2004

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

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

zbMATH Keywords

factorial designsoftware testingorthogonal arraytransversal designcovering arraymixed covering arraynetwork testing

Mathematics Subject Classification ID

Factorial statistical designs (62K15) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15)

Recommendations

• Covering arrays via set covers
• Algorithmic methods for covering arrays of higher index
• Problems and algorithms for covering arrays
• Covering arrays and intersecting codes
• Upper bounds on the size of covering arrays
• Covering arrays for some equivalence classes of words
• scientific article; zbMATH DE number 5177325
• Sequence covering arrays
• Covering arrays and hash families
• Algebraic techniques for covering arrays and related structures

Cited in

(19)

• Optimal and near-optimal mixed covering arrays by column expansion
• Products of mixed covering arrays of strength two
• Mixed covering arrays on graphs
• Constructions of mixed covering arrays with strength \( \ge 3\)
• Covering array EXtender
• Covering arrays on graphs
• Mixed covering arrays on graphs of small treewidth
• Problems and algorithms for covering arrays
• Optimum mixed level detecting arrays
• The test suite generation problem: optimal instances and their implications
• Generalized covering designs and clique coverings
• Mixed covering arrays on 3-uniform hypergraphs
• Cover starters for covering arrays of strength two
• Bipartite locating array
• Cost-efficient mixed-level covering designs for testing experiments
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Covering arrays avoiding forbidden edges
• Mixed covering arrays of strength three with few factors
• Lower bound and construction of mixed-level locating arrays

This page was built for publication: Covering arrays with mixed alphabet sizes

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