Bipartite locating array

DOI10.1007/s10114-020-8522-2zbMath1436.62387OpenAlexW2997630593WikidataQ126460303 ScholiaQ126460303MaRDI QIDQ2287790

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

optimalitylower boundinteraction faultsbipartite locating arrays

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal locating arrays for at most two faults
• Optimum mixed level detecting arrays
• The equivalence between optimal detecting arrays and super-simple OAs
• Detecting arrays and their optimality
• Optimality and constructions of locating arrays
• Locating and detecting arrays for interaction faults
• Covering arrays with mixed alphabet sizes
• Products of mixed covering arrays of strength two
• Recent Advances in Constraints

This page was built for publication: Bipartite locating array