Complete enumeration of pure-level and mixed-level orthogonal arrays

✍ Scribed by Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen

• Publisher: John Wiley and Sons
• Year: 2009
• Tongue: English
• Weight: 151 KB
• Volume: 18
• Category: Article
• ISSN: 1063-8539
• DOI: 10.1002/jcd.20236

✦ Synopsis

Abstract

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