Optimum mixed level detecting arrays
From MaRDI portal
Publication:464194
DOI10.1214/14-AOS1228zbMath1297.62177arXiv1408.3205MaRDI QIDQ464194
Ce Shi, Jianxing Yin, Yu. Tang
Publication date: 17 October 2014
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.3205
Approximation methods and heuristics in mathematical programming (90C59) Detection theory in information and communication theory (94A13) Fault detection; testing in circuits and networks (94C12) Factorial statistical designs (62K15)
Related Items (5)
Lower bound and construction of mixed-level locating arrays ⋮ Detecting arrays for effects of single factors ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ A construction of variable strength covering arrays ⋮ Bipartite locating array
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new series of main effects plus one plan for \(2^m\) factorial experiments with \(m=4\lambda \pm 1\) and \(2m\) runs
- The equivalence between optimal detecting arrays and super-simple OAs
- Constructions of new orthogonal arrays and covering arrays of strength three
- Orthogonal arrays. Theory and applications
- Searching probabilities for nonzero effects in search designs for the noisy case
- Detecting arrays and their optimality
- Mixed covering arrays of strength three with few factors
- Locating and detecting arrays for interaction faults
- Covering arrays with mixed alphabet sizes
- Products of mixed covering arrays of strength two
- Two general classes of search designs for factor screening experiments with factors at three levels
This page was built for publication: Optimum mixed level detecting arrays
