Abstract
In this paper we present an effective algorithm for the construction and the identification of two-level nonisomorphic orthogonal arrays. Using this algorithm, we identify and list a full catalogue of nonisomorphic orthogonal arrays with parameters OA(24,7,2,t), OA(28,6,2,t) and OA(32,6,2,t), t ≥ 2. Some statistical properties of these designs are also considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bulutoglu DA, Margot F (2006) Classification of orthogonal arrays by integer programming, preprint
Cheng C-S, Deng L-Y, Tang B (2002) Generalized minimum aberration and design efficiency for nonregular fractional factorial designs. Stat Sin 12:991–1000
Deng L-Y, Tang B (1999) Generalized resolution and minimum aberration criteria for Plackett–Burman and other nonregular factorial designs. Stat Sin 9:1071–1082
Deng L-Y, Tang B (2002) Design selection and classification for Hadamard matrices using generalized minimum aberration criteria. Technometrics 44:173–184
Evangelaras H, Georgiou S, Koukouvinos C (2004) Evaluation of inequivalent projections of Hadamard matrices of order 24. Metrika 59:51–73
Evangelaras H, Koukouvinos C, Lappas E (2006a) An efficient algorithm for the identification of isomorphic orthogonal arrays. J Discrete Math Scie Cryptograph 9:125–132
Evangelaras H, Koukouvinos C, Lappas E (2006b) Further contributions to nonisomorphic two level orthogonal arrays. J Stat Plann Inference (in press)
Hedayat AS, Sloane NJA, Stufken J (1999) Orthogonal arrays: theory and applications. Springer, Berlin Heidelberg New York
Li Y, Deng L-Y, Tang B (2004) Design catalogue based on minimum. J Stat Plan Inference 124:219–230
Li Y (2002) New factorial designs that cannot be embedded into Hadamard matrices. Int Math J 2:527–534
Ma C-X, Fang K-T (2001) A note on generalized aberration in factorial designs. Metrika 53:85–93
Seiden E (2001) A remark on the two level orthogonal array of order 12. SUT J Math 37:43–49
Stufken J, Tang B (2006) Complete enumeration of orthogonal arrays of strength d with d + 2 constraints. Ann Stat (in press)
Sun DX, Li W, Ye KQ (2002) An algorithm for sequentially constructing nonisomorphic orthogonal designs and its applications, preprint
Todd JA (1933) A combinatorial problem. J Math Phys 12:321–333
Wang JC, Wu CFJ (1995) A hidden projection property of Plackett–Burman and related designs. Stat Sin 5:235–250
Xu H, Wong A (2006) Two-level noregular designs from quaternary linear codes. Stat Sin (in press)
Xu H, Wu CFJ (2001) Generalized minimum aberration for asymmetrical fractional factorial designs. Ann Stat 29:1066–1077
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Angelopoulos, P., Evangelaras, H., Koukouvinos, C. et al. An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays. Metrika 66, 139–149 (2007). https://doi.org/10.1007/s00184-006-0101-8
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00184-006-0101-8