Premium
Complete enumeration of pure‐level and mixed‐level orthogonal arrays
Author(s) -
Schoen Eric D.,
Eendebak Pieter T.,
Nguyen Man V. M.
Publication year - 2010
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/jcd.20236
Subject(s) - enumeration , mathematics , combinatorics , set (abstract data type) , orthogonal array , limiting , series (stratigraphy) , discrete mathematics , statistics , computer science , mechanical engineering , paleontology , taguchi methods , engineering , biology , programming language
We specify an algorithm to enumerate a minimum complete set of combinatorially non‐isomorphic orthogonal arrays of given strength t , run‐size N , and level‐numbers of the factors. The algorithm is the first one handling general mixed‐level and pure‐level cases. Using an implementation in C, we generate most non‐trivial series for t =2, N ≤28, t =3, N ≤64, and t =4, N ≤168. The exceptions define limiting run‐sizes for which the algorithm returns complete sets in a reasonable amount of time. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 123–140, 2010