Optimal locating arrays for at most two faults
From MaRDI portal
(Redirected from Publication:424251)
Recommendations
Cites work
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- Compound Orthogonal Arrays
- Locating and detecting arrays for interaction faults
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
- Problems and algorithms for covering arrays
- Products of mixed covering arrays of strength two
- The CRC handbook of combinatorial designs
Cited in
(12)- The equivalence between optimal detecting arrays and super-simple OAs
- Locating one pairwise interaction: three recursive constructions
- Optimality and constructions of locating arrays
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
- Locating and detecting arrays for interaction faults
- Bipartite locating array
- Finding minimum locating arrays using a CSP solver
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Disjoint spread systems and fault location
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\)
- On a combinatorial framework for fault characterization
- Lower bound and construction of mixed-level locating arrays
This page was built for publication: Optimal locating arrays for at most two faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q424251)
