Detecting arrays and their optimality

DOI10.1007/S10114-011-0184-7MaRDI QIDQ1942178zbMATH OpenOpenAlexFDO

Authors 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

boundscomponent interactionconstructionsdetecting arraysinteraction faultslower bound on the size of detecting arraysoptimality

Mathematics Subject Classification ID

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

Recommendations

• Optimum mixed level detecting arrays
• The equivalence between optimal detecting arrays and super-simple OAs
• Optimality and constructions of locating arrays
• Optimum detecting arrays for independent interaction faults
• Consecutive detecting arrays for interaction faults

Cites work

• A Generalization of a Theorem due to MacNeish
• Constructions of new orthogonal arrays and covering arrays of strength three
• scientific article; zbMATH DE number 1382770 (Why is no real title available?)
• Locating and detecting arrays for interaction faults
• On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
• Orthogonal Arrays of Index Unity
• The CRC handbook of combinatorial designs

Cited in

(20)

• Detecting arrays for main effects
• Consecutive detecting arrays for interaction faults
• Existence of super-simple \(\mathrm{OA}_\lambda (3,5,v)\)'s
• Bipartite locating array
• Arrays for combinatorial interaction testing: a review on constructive approaches
• Optimality and constructions of locating arrays
• Optimum detecting arrays for independent interaction faults
• Inferring complete initialization of arrays
• scientific article; zbMATH DE number 721906 (Why is no real title available?)
• On the intricacy of avoiding multiple-entry arrays
• Optimum mixed level detecting arrays
• Covering strong separating hash families
• Lower bound and construction of mixed-level locating arrays
• Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
• scientific article; zbMATH DE number 7120968 (Why is no real title available?)
• Detecting arrays for effects of single factors
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• The equivalence between optimal detecting arrays and super-simple OAs
• Detecting arrays for effects of multiple interacting factors
• Lower bounds and construction of detecting arrays

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1942178)