✦ LIBER ✦

Orthogonal arrays of strength 3

✍ Scribed by Donald L. Kreher

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 160 KB
Volume: 4
Category: Article
ISSN: 1063-8539
DOI: 10.1002/(sici)1520-6610(1996)4:1<67::aid-jcd7>3.0.co;2-y

No coin nor oath required. For personal study only.

✦ Synopsis

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 t by I column array appears the same number A = $ times. We denote such an array by OA,(t, k , s). The parameter A is called the index of the array.

Existence results for orthogonal arrays of strength greater than or equal to three are few and far between. A summary of these results is given in [2]. For t = 3, the best known upper bound on k for fixed A and s is the Bose-Bush bound [3]:

A improvement is obtained when A -1 = b (mod s -I) and 1 5 b 5 s -1:

📜 SIMILAR VOLUMES

The decomposability of simple orthogonal

The decomposability of simple orthogonal arrays on 3 symbols having t + 1 rows and strength t

✍ Wiebke S. Diestelkamp 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

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

Products of mixed covering arrays of str

Products of mixed covering arrays of strength two

✍ Charles J. Colbourn; Sosina S. Martirosyan; Gary L. Mullen; Dennis Shasha; Georg 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract A __covering array__ __CA__(__N__;__t__,__k__, __v__ is an __N__ × __k__ array such that every __N__ × __t__ subarray contains all __t__‐tuples from __v__ symbols __at least__ once, where __t__ is the __strength__ of the array. Covering arrays are used to generate software test suites t

On the state of strength-three covering

On the state of strength-three covering arrays

✍ M. Chateauneuf; D. L. Kreher 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract A __covering array__ of __size__ __N__, __strength__ __t__, __degree k__, and __order__ υ is a __k × N__ array on υ symbols in which every __t × N__ subarray contains every possible __t__ × 1 column at least once. We present explicit constructions, constructive upper bounds on the size

Balanced arrays of strength two from blo

Balanced arrays of strength two from block designs

✍ Kishore Sinha; Vanshi Dhar; G. M. Saha; Sanpei Kageyama 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract Some constructions of balanced arrays of strength two are provided by use of rectangular designs, group divisible designs, and nested balanced incomplete block designs. Some series of such arrays are also presented as well as orthogonal arrays, with illustrations. © 2002 Wiley Periodica

Covering arrays of higher strength from

Covering arrays of higher strength from permutation vectors

✍ George B. Sherwood; Sosina S. Martirosyan; Charles J. Colbourn 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract A __covering array__ __CA(N;t,k,v)__ is an __N × k__ array such that every __N × t__ sub‐array contains all __t__‐tuples from __v__ symbols __at least__ once, where __t__ is the __strength__ of the array. Covering arrays are used to generate software test suites to cover all __t__‐sets

Complete enumeration of pure-level and m

Complete enumeration of pure-level and mixed-level orthogonal arrays

✍ Eric D. Schoen; Pieter T. Eendebak; Man V. M. Nguyen 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

## 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