Optimal locating arrays for at most two faults

DOI10.1007/S11425-011-4307-5zbMath1239.05026OpenAlexW2261724165MaRDI 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

zbMATH Keywords

optimalityboundconstructionlocating arrays

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12) Reliability and life testing (62N05)

Related Items (8)

On a combinatorial framework for fault characterization ⋮ Lower bound and construction of mixed-level locating arrays ⋮ Unnamed Item ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) ⋮ Bipartite locating array ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Disjoint Spread Systems and Fault Location

Cites Work

• Unnamed Item
• Unnamed Item
• Problems and algorithms for covering arrays
• Locating and detecting arrays for interaction faults
• Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
• Compound Orthogonal Arrays
• Products of mixed covering arrays of strength two

This page was built for publication: Optimal locating arrays for at most two faults