We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays i
Parameter Inequalities for Orthogonal Arrays with Mixed Levels
β Scribed by Wiebke S. Diestelkamp
- Book ID
- 111579114
- Publisher
- Springer
- Year
- 2004
- Tongue
- English
- Weight
- 121 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract We specify an algorithm to enumerate a minimum complete set of combinatorially nonβisomorphic orthogonal arrays of given strength __t__, runβsize __N__, and levelβnumbers of the factors. The algorithm is the first one handling general mixedβlevel and pureβlevel cases. Using an implement
## Abstract We correct an error found in Schoen, Endebak, Nguyen, J Combin Designs 18 (2010), 123β140. Β© 2010 Wiley Periodicals, Inc. J Combin Designs 18: 488, 2010
We describe a method for ΓΏnding mixed orthogonal arrays of strength 2 with a large number of 2-level factors. The method starts with an orthogonal array of strength 2, possibly tight, that contains mostly 2-level factors. By a computer search of this starting array, we attempt to ΓΏnd as large a numb