A new construction for orthogonal arrays of strength 3 is given. 0 1996 John Wiley & Sons, Inc. ## 1 . INTRODUCTION An orthogonal array of size N, degree k, order s, and strength t is a k by N array with entries from a set of s 2 2 symbols, having the property that in every t by N subarray, every
An approach of constructing mixed-level orthogonal arrays of strength ⩾ 3
✍ Scribed by Ling Jiang, JianXing Yin
- Book ID
- 120796565
- Publisher
- SP Science China Press
- Year
- 2013
- Tongue
- English
- Weight
- 172 KB
- Volume
- 56
- Category
- Article
- ISSN
- 1674-7283
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
## 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