Optimal locating arrays for at most two faults
From MaRDI portal
Publication:424251
DOI10.1007/S11425-011-4307-5zbMATH Open1239.05026OpenAlexW2261724165MaRDI QIDQ424251FDOQ424251
Authors: Ce Shi, Yu Tang, Jianxing Yin 
Publication date: 31 May 2012
Published in: Science China. Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-011-4307-5
Recommendations
Reliability and life testing (62N05) Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12)
Cites Work
- Locating and detecting arrays for interaction faults
- The CRC handbook of combinatorial designs
- Compound Orthogonal Arrays
- Products of mixed covering arrays of strength two
- Problems and algorithms for covering arrays
- Title not available (Why is that?)
- Locating errors using ELAs, covering arrays, and adaptive testing algorithms
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)
