Optimum detecting arrays for independent interaction faults
From MaRDI portal
(Redirected from Publication:255973)
Recommendations
Cites work
- scientific article; zbMATH DE number 5177325 (Why is no real title available?)
- scientific article; zbMATH DE number 1512990 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- A Generalization of a Theorem due to MacNeish
- Compound Orthogonal Arrays
- Constructions of new orthogonal arrays and covering arrays of strength three
- Detecting arrays and their optimality
- Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
- Locating and detecting arrays for interaction faults
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- Orthogonal Arrays of Index Unity
- Products of mixed covering arrays of strength two
- Strength two covering arrays: existence tables and projection
- The CRC handbook of combinatorial designs
- The equivalence between optimal detecting arrays and super-simple OAs
Cited in
(9)- Detecting arrays and their optimality
- Detecting arrays for effects of single factors
- Expected time to detection of interaction faults
- Optimum mixed level detecting arrays
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- Detecting arrays for effects of multiple interacting factors
- Consecutive detecting arrays for interaction faults
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
This page was built for publication: Optimum detecting arrays for independent interaction faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255973)