1,2

Annals of Statistics 2007, Vol. 35, No. 2, 793-814; 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.

John Stufken and Boxin Tang, Complete enumeration of two-Level orthogonal arrays of strength d with d+2 constraints

Sequence in context: A025587 A101498 A027965 this_sequence A023552 A009859 A122768

Adjacent sequences: A130142 A130143 A130144 this_sequence A130146 A130147 A130148

nonn

Jonathan Vos Post (jvospost2(AT)yahoo.com), Aug 15 2007