Mixed covering arrays of strength three with few factors
From MaRDI portal
Publication:2276196
Recommendations
Cites work
- scientific article; zbMATH DE number 53885 (Why is no real title available?)
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Constructions of new orthogonal arrays and covering arrays of strength three
- Covering and radius-covering arrays: constructions and classification
- Covering arrays of strength 3 and 4 from holey difference matrices
- Covering arrays of strength three
- Covering arrays with mixed alphabet sizes
- Largest induced subgraphs of the n-cube that contain no 4-cycles
- Mixed covering arrays on graphs
- On \(t\)-covering arrays
- On the existence of orthogonal arrays OA\((3,5,4n+2)\)
- On the state of strength-three covering arrays
- Optimal and near-optimal mixed covering arrays by column expansion
- Orthogonal arrays of strength 3 and small run sizes
- Orthogonal arrays. Theory and applications
- Problems and algorithms for covering arrays
- Products of mixed covering arrays of strength two
- Roux-type constructions for covering arrays of strengths three and four
- Some new constructions of strength 3 mixed orthogonal arrays
- Strength two covering arrays: existence tables and projection
- The CRC handbook of combinatorial designs
Cited in
(7)- Optimum mixed level detecting arrays
- Cost-efficient mixed-level covering designs for testing experiments
- Optimal and near-optimal mixed covering arrays by column expansion
- A construction of variable strength covering arrays
- Mixed covering arrays on 3-uniform hypergraphs
- Mixed covering arrays on graphs
- Constructions of mixed covering arrays with strength \( \ge 3\)
This page was built for publication: Mixed covering arrays of strength three with few factors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276196)