The equivalence between optimal detecting arrays and super-simple OAs
From MaRDI portal
Publication:663478
DOI10.1007/s10623-011-9498-9zbMath1283.05045OpenAlexW2129383849MaRDI QIDQ663478
Jianxing Yin, Ce Shi, Yu. Tang
Publication date: 15 February 2012
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-011-9498-9
Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12)
Related Items (11)
The Existence of Mixed Orthogonal Arrays with Four and Five Factors of Strength Two ⋮ Lower bound and construction of mixed-level locating arrays ⋮ Detecting arrays for effects of single factors ⋮ Consecutive detecting arrays for interaction faults ⋮ Optimum mixed level detecting arrays ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s ⋮ Bipartite locating array ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Further results on 2-uniform states arising from irredundant orthogonal arrays ⋮ Optimum detecting arrays for independent interaction faults
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal locating arrays for at most two faults
- Constructions of new orthogonal arrays and covering arrays of strength three
- Detecting arrays and their optimality
- Locating and detecting arrays for interaction faults
- Strength two covering arrays: existence tables and projection
- Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
- Products of mixed covering arrays of strength two
- A Generalization of a Theorem due to MacNeish
- Orthogonal Arrays of Index Unity
This page was built for publication: The equivalence between optimal detecting arrays and super-simple OAs
