Optimum detecting arrays for independent interaction faults

DOI10.1007/s10114-016-5049-7zbMath1331.05046MaRDI QIDQ255973

Ce Shi, Cheng Min Wang

Publication date: 9 March 2016

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-016-5049-7

zbMATH Keywords

detecting arrays; independent interaction faults; optimum; super-simple

Mathematics Subject Classification ID

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

05B15: Orthogonal arrays, Latin squares, Room squares

94C12: Fault detection; testing in circuits and networks

Related Items

Detecting arrays for effects of single factors, Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\), Arrays for combinatorial interaction testing: a review on constructive approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The equivalence between optimal detecting arrays and super-simple OAs
• Constructions of new orthogonal arrays and covering arrays of strength three
• On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
• Detecting arrays and their optimality
• Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
• Locating and detecting arrays for interaction faults
• Strength two covering arrays: existence tables and projection
• Compound Orthogonal Arrays
• Products of mixed covering arrays of strength two
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity