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
On difference schemes and orthogonal arrays of strength t
β Scribed by A.S. Hedayat; John Stufken; Guoqin Su
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 870 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
β¦ Synopsis
Difference schemes (Bose and Bush, Ann. Math. Statist. 23 (1952), 508-524) form a useful tool for the construction of orthogonal arrays of strength 2. We study a generalization of these schemes, difference schemes of strength t, which are useful for the construction and representation of orthogonal arrays of strength t. We study the existence of difference schemes of strength t, methods for their construction, and methods to construct orthogonal arrays of strength t from these schemes.
π SIMILAR VOLUMES
It is well-known that all orthogonal arrays of the form OANY t 1Y 2Y t are decomposable into ! orthogonal arrays of strength t and index 1. While the same is not generally true when s 3, we will show that all simple orthogonal arrays of the form OANY t 1Y 3Y t are also decomposable into orthogonal a
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