Optimal locating arrays for at most two faults
From MaRDI portal
Publication:424251
DOI10.1007/s11425-011-4307-5zbMath1239.05026MaRDI QIDQ424251
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
05B15: Orthogonal arrays, Latin squares, Room squares
94C12: Fault detection; testing in circuits and networks
62N05: Reliability and life testing
Related Items
Lower bound and construction of mixed-level locating arrays, Unnamed Item, Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\), The equivalence between optimal detecting arrays and super-simple OAs, On a combinatorial framework for fault characterization, Bipartite locating array, Arrays for combinatorial interaction testing: a review on constructive approaches, Disjoint Spread Systems and Fault Location
Cites Work