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

Simple item page
dc.creatorStufken, John
dc.creatorTang, Boxin
dc.date2007-08-14
dc.date.accessioned2026-07-07T08:24:37Z
dc.date.available2026-07-07T08:24:37Z
dc.descriptionEnumerating 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=\lambda2^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.
dc.descriptionPublished 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)
dc.identifierhttps://arxiv.org/abs/0708.1908
dc.identifierhttp://arxiv.org/abs/0708.1908
dc.identifierAnnals of Statistics 2007, Vol. 35, No. 2, 793-814
dc.identifierdoi:10.1214/009053606000001325
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/136401
dc.subjectStatistics Theory
dc.subject62K15 (Primary)
dc.titleComplete enumeration of two-Level orthogonal arrays of strength $d$ with $d+2$ constraints
dc.typetext

Files

Collections

arXiv