Detecting arrays and their optimality
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- A Generalization of a Theorem due to MacNeish
- Constructions of new orthogonal arrays and covering arrays of strength three
- 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
- The CRC handbook of combinatorial designs
Cited in
(19)- Optimum detecting arrays for independent interaction faults
- The equivalence between optimal detecting arrays and super-simple OAs
- Optimality and constructions of locating arrays
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
- scientific article; zbMATH DE number 721906 (Why is no real title available?)
- Detecting arrays for effects of single factors
- Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
- On the intricacy of avoiding multiple-entry arrays
- Optimum mixed level detecting arrays
- Mixed-level covering, locating, and detecting arrays via cyclotomy
- Covering strong separating hash families
- scientific article; zbMATH DE number 7120968 (Why is no real title available?)
- Bipartite locating array
- Detecting arrays for main effects
- Detecting arrays for effects of multiple interacting factors
- Consecutive detecting arrays for interaction faults
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Inferring complete initialization of arrays
- Lower bound and construction of mixed-level locating arrays
This page was built for publication: Detecting arrays and their optimality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1942178)