Complete enumeration of two-Level orthogonal arrays of strength $d$ with $d+2$ constraints

Abstract

Enumerating nonisomorphic orthogonal arrays is an important, yet very difficult, problem. Although orthogonal arrays with a specified set of parameters have been enumerated in a number of cases, general results are extremely rare. In this paper, we provide a complete solution to enumerating nonisomorphic two-level orthogonal arrays of strength $d$ with $d+2$ constraints for any $d$ and any run size $n=\lambda 2^d$. Our results not only give the number of nonisomorphic orthogonal arrays for given $d$ and $n$, but also provide a systematic way of explicitly constructing these arrays. Our approach to the problem is to make use of the recently developed theory of $J$-characteristics for fractional factorial designs. Besides the general theoretical results, the paper presents some results from applications of the theory to orthogonal arrays of strength two, three and four.

Published at http://dx.doi.org/10.1214/009053606000001325 in the Annals of Statistics (http://www.imstat.org/aos/) by the Institute of Mathematical Statistics (http://www.imstat.org)

Cited by in corpus (6)

• A trigonometric approach to quaternary code designs with application to one-eighth and one-sixteenth fractions
• Algorithms for finding generalized minimum aberration designs
• Orthogonal Arrays: A Review
• Quarter-fraction factorial designs constructed via quaternary codes
• Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
• The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program