Bipartite locating array

DOI10.1007/S10114-020-8522-2MaRDI QIDQ2287790zbMATH OpenOpenAlexWikidataFDO

Authors Wen Jie Zhong, Zong-Feng Qi, Yu Tang

Publication date 21 January 2020

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

Full work available at URL https://doi.org/10.1007/s10114-020-8522-2

zbMATH Keywords

bipartite locating arraysinteraction faultslower boundoptimality

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Statistical block designs (62K10) Factorial statistical designs (62K15)

Review text

A locating array is a special experimental design which is useful for locating interaction faults in component-based systems. Bipartite locating array is a generalization to locating array and is typically useful to locate interaction faults between two specific groups. When a single fault is to be located, the authors present a lower bound of the size of a bipartite locating array. This lower bound is used to find optimal bipartite locating arrays. If this lower bound is an interger the authors provide combinatorical construction methods for optimal bipartite locating arrays.

Recommendations

• Optimality and constructions of locating arrays
• Optimal locating arrays for at most two faults
• Locating and detecting arrays for interaction faults
• Locating one pairwise interaction: three recursive constructions
• Separating interaction effects using locating and detecting arrays

Cites work

• Covering arrays with mixed alphabet sizes
• Detecting arrays and their optimality
• scientific article; zbMATH DE number 1382769 (Why is no real title available?)
• Locating and detecting arrays for interaction faults
• Optimal locating arrays for at most two faults
• Optimality and constructions of locating arrays
• Optimum mixed level detecting arrays
• Products of mixed covering arrays of strength two
• Recent Advances in Constraints
• Software and hardware testing using combinatorial covering suites
• The CRC handbook of combinatorial designs
• The equivalence between optimal detecting arrays and super-simple OAs

Cited in

(2)

• Optimality and constructions of locating arrays
• Optimal locating arrays for at most two faults

This page was built for publication: Bipartite locating array

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