Premium
Generalized orthogonal arrays: Constructions and related graphs
Author(s) -
Adams Michael J.
Publication year - 1999
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(1999)7:1<31::aid-jcd5>3.0.co;2-u
Subject(s) - orthogonal array , mathematics , orthogonal basis , combinatorics , set (abstract data type) , orthogonal transformation , combinatorial design , discrete mathematics , algorithm , computer science , taguchi methods , statistics , physics , quantum mechanics , programming language
Generalized orthogonal arrays were first defined to provide a combinatorial characterization of ( t , m , s )‐nets. In this article we describe three new constructions for generalized orthogonal arrays. Two of these constructions are straightforward generalizations of constructions for orthogonal arrays and one employs new techniques. We construct families of generalized orthogonal arrays using orthogonal arrays and provide net parameters obtained from our constructions. In addition, we define a set of graphs associated with a generalized orthogonal array which provide information about the structure of the array. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 31–39, 1999