Products of mixed covering arrays of strength two
From MaRDI portal
Publication:5469151
DOI10.1002/JCD.20065zbMATH Open1134.05306OpenAlexW1986348493MaRDI QIDQ5469151FDOQ5469151
Authors: Charles J. Colbourn, Sosina S. Martirosyan, Gary L. Mullen, Dennis Shasha, George B. Sherwood, Joseph L. Yucas 
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
Recommendations
Orthogonal arrays, Latin squares, Room squares (05B15) Combinatorial aspects of packing and covering (05B40)
Cites Work
Cited In (37)
- On the existence of orthogonal arrays OA\((3,5,4n+2)\)
- Optimum detecting arrays for independent interaction faults
- Optimal and near-optimal mixed covering arrays by column expansion
- A construction of variable strength covering arrays
- Covering arrays on product graphs
- The equivalence between optimal detecting arrays and super-simple OAs
- A survey of methods for constructing covering arrays
- Roux-type constructions for covering arrays of strengths three and four
- Optimal locating arrays for at most two faults
- Merging covering arrays and compressing multiple sequence alignments
- Covering array EXtender
- Covering arrays: using prior information for construction, evaluation and to facilitate fault localization
- Improving two recursive constructions for covering arrays
- Optimality and constructions of locating arrays
- Mixed covering arrays on graphs of small treewidth
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- Subspace restrictions and affine composition for covering perfect hash families
- Optimum mixed level detecting arrays
- Locating and detecting arrays for interaction faults
- Strength two covering arrays: existence tables and projection
- Generalized covering designs and clique coverings
- Mixed covering arrays on 3-uniform hypergraphs
- Constructing new covering arrays from LFSR sequences over finite fields
- Cover starters for covering arrays of strength two
- Revised schematic array
- Bipartite locating array
- Randomized post-optimization of covering arrays
- Covering arrays of strength 3 and 4 from holey difference matrices
- Schematic saturated orthogonal arrays obtained by using the expansive replacement method
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Title not available (Why is that?)
- Disjoint spread systems and fault location
- Constructions of covering arrays of strength five
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- A greedy algorithm to construct covering arrays using a graph representation
- Mixed covering arrays of strength three with few factors
- Lower bound and construction of mixed-level locating arrays
Uses Software
This page was built for publication: Products of mixed covering arrays of strength two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469151)
