Enumeration and classification of orthogonal arrays
We specify an algorithm to enumerate a minimum complete set of combinatorially non-isomorphic orthogonal arrays of given strength, run-size, and numbers of factor levels. We consider the classification of arrays according to several criteria of practical interest, differentiated according to the strength of the arrays. We exemplify classification using several series of mixed arrays, and we propose to discard arrays that are inadmissible according to the criteria.
|Date of creation:||Oct 2007|
|Date of revision:|
|Contact details of provider:|| Postal: Prinsstraat 13, B-2000 Antwerpen|
Web page: https://www.uantwerp.be/en/faculties/applied-economic-sciences/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- C.-S. Cheng & D. M. Steinberg & D. X. Sun, 1999. "Minimum aberration and model robustness for two-level fractional factorial designs," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 61(1), pages 85-93.
- H. Evangelaras & C. Koukouvinos & A. M. Dean & C. A. Dingus, 2005. "Projection properties of certain three level orthogonal arrays," Metrika- International Journal for Theoretical and Applied Statistics, Springer, vol. 62(2), pages 241-257, November.
When requesting a correction, please mention this item's handle: RePEc:ant:wpaper:2007021. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Joeri Nys)
If references are entirely missing, you can add them using this form.