A note on Morris' bound for search designs

DOI10.1016/S0378-3758(98)00099-8zbMath0924.62084OpenAlexW1997080549MaRDI QIDQ1298923

Lih-Yuan Deng, Dennis K. J. Lin

Publication date: 9 November 1999

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(98)00099-8

zbMATH Keywords

orthogonal arraystwo-level designstrength one

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Factorial statistical designs (62K15)

Cites Work

• Unnamed Item
• Minimum number of runs for two-level factorial search designs

This page was built for publication: A note on Morris' bound for search designs