Detecting arrays and their optimality

DOI10.1007/s10114-011-0184-7zbMath1260.05022OpenAlexW2071912042MaRDI QIDQ1942178

Jianxing Yin, Yu. Tang

Publication date: 18 March 2013

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

Full work available at URL: https://doi.org/10.1007/s10114-011-0184-7

zbMATH Keywords

optimalityboundsconstructionsdetecting arrayscomponent interactioninteraction faultslower bound on the size of detecting arrays

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Orthogonal arrays, Latin squares, Room squares (05B15) Fault detection; testing in circuits and networks (94C12) Discrete location and assignment (90B80)

Related Items (max. 100)

Lower bound and construction of mixed-level locating arrays ⋮ Detecting arrays for effects of single factors ⋮ Consecutive detecting arrays for interaction faults ⋮ Optimum mixed level detecting arrays ⋮ The equivalence between optimal detecting arrays and super-simple OAs ⋮ Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s ⋮ Bipartite locating array ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Optimum detecting arrays for independent interaction faults

Cites Work

• 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
• Locating and detecting arrays for interaction faults
• A Generalization of a Theorem due to MacNeish
• Orthogonal Arrays of Index Unity
• Unnamed Item
• Unnamed Item

This page was built for publication: Detecting arrays and their optimality