Strength two covering arrays: existence tables and projection

DOI10.1016/j.disc.2007.07.050zbMath1134.05013OpenAlexW2036015638MaRDI QIDQ2470443

Charles J. Colbourn

Publication date: 14 February 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.07.050

zbMATH Keywords

orthogonal arraycovering array

Mathematics Subject Classification ID

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

Related Items

Ordered covering arrays and upper bounds on covering codes, Consecutive detecting arrays for interaction faults, Augmentation of covering arrays of strength two, A greedy-metaheuristic 3-stage approach to construct covering arrays, The equivalence between optimal detecting arrays and super-simple OAs, Constructions of covering arrays of strength five, Asymptotic and constructive methods for covering perfect hash families and covering arrays, Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\), Classification of orthogonal arrays by integer programming, Randomized post-optimization of covering arrays, Covering and radius-covering arrays: constructions and classification, D-optimal designs with interaction coverage, Mixed covering arrays of strength three with few factors, Optimal and near-optimal mixed covering arrays by column expansion, Covering arrays of strength 3 and 4 from holey difference matrices, Arrays for combinatorial interaction testing: a review on constructive approaches, Merging covering arrays and compressing multiple sequence alignments, A survey of methods for constructing covering arrays, Cover starters for covering arrays of strength two, Resolvable covering arrays, Optimum detecting arrays for independent interaction faults

Uses Software

• AETG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal arrays. Theory and applications
• Upper bounds for covering arrays by tabu search.
• Problems and algorithms for covering arrays
• On the state of strength-three covering arrays
• Group construction of covering arrays
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• Covering arrays and intersecting codes
• Products of mixed covering arrays of strength two
• Recent Advances in Constraints