Mixed covering arrays of strength three with few factors
From MaRDI portal
Publication:2276196
DOI10.1016/j.jspi.2011.05.018zbMath1222.62099MaRDI QIDQ2276196
Jie Yan, Ce Shi, Charles J. Colbourn, Cheng Min Wang
Publication date: 1 August 2011
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2011.05.018
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- On the existence of orthogonal arrays OA\((3,5,4n+2)\)
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructions of new orthogonal arrays and covering arrays of strength three
- Optimal and near-optimal mixed covering arrays by column expansion
- Covering arrays of strength 3 and 4 from holey difference matrices
- Orthogonal arrays. Theory and applications
- Covering arrays of strength three
- Problems and algorithms for covering arrays
- On \(t\)-covering arrays
- Strength two covering arrays: existence tables and projection
- Some new constructions of strength 3 mixed orthogonal arrays
- Orthogonal arrays of strength 3 and small run sizes
- On the state of strength-three covering arrays
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Covering arrays with mixed alphabet sizes
- Mixed covering arrays on graphs
- Products of mixed covering arrays of strength two