Products of mixed covering arrays of strength two
From MaRDI portal
Publication:5469151
DOI10.1002/jcd.20065zbMath1134.05306OpenAlexW1986348493MaRDI QIDQ5469151
Joseph L. Yucas, Sosina S. Martirosyan, George B. Sherwood, Gary L. Mullen, Dennis Shasha, Charles J. Colbourn
Publication date: 16 May 2006
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20065
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Related Items (36)
Mixed covering arrays on graphs of small treewidth ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Lower bound and construction of mixed-level locating arrays ⋮ Covering arrays on product graphs ⋮ Mixed covering arrays on 3-uniform hypergraphs ⋮ Unnamed Item ⋮ On the existence of orthogonal arrays OA\((3,5,4n+2)\) ⋮ Schematic saturated orthogonal arrays obtained by using the expansive replacement method ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Locating and detecting arrays for interaction faults ⋮ A greedy-metaheuristic 3-stage approach to construct covering arrays ⋮ Optimal locating arrays for at most two faults ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Optimum mixed level detecting arrays ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Constructions of covering arrays of strength five ⋮ Covering array EXtender ⋮ Strength two covering arrays: existence tables and projection ⋮ Randomized post-optimization of covering arrays ⋮ Mixed covering arrays of strength three with few factors ⋮ A construction of variable strength covering arrays ⋮ Subspace restrictions and affine composition for covering perfect hash families ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ Bipartite locating array ⋮ Covering arrays of strength 3 and 4 from holey difference matrices ⋮ Covering arrays: using prior information for construction, evaluation and to facilitate fault localization ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ Disjoint Spread Systems and Fault Location ⋮ A survey of methods for constructing covering arrays ⋮ Generalized covering designs and clique coverings ⋮ Cover starters for covering arrays of strength two ⋮ Optimality and constructions of locating arrays ⋮ Improving two recursive constructions for covering arrays ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ Optimum detecting arrays for independent interaction faults
Uses Software
Cites Work
This page was built for publication: Products of mixed covering arrays of strength two
