Lower bound and construction of mixed-level locating arrays

DOI10.1080/03610926.2020.1722841MaRDI QIDQ5079084zbMATH OpenOpenAlexFDO

Authors

Publication date 25 May 2022

Published in Communications in Statistics: Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2020.1722841

zbMATH Keywords

locating arraylower boundmixed-levelsimulated annealing

Mathematics Subject Classification ID

Statistics (62-XX) Statistical block designs (62K10) Factorial statistical designs (62K15)

Cites work

• Covering arrays with mixed alphabet sizes
• Detecting arrays and their optimality
• Locating and detecting arrays for interaction faults
• Locating errors using ELAs, covering arrays, and adaptive testing algorithms
• Locating one pairwise interaction: three recursive constructions
• 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
• The equivalence between optimal detecting arrays and super-simple OAs

This page was built for publication: Lower bound and construction of mixed-level locating arrays

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