✦ LIBER ✦

Products of mixed covering arrays of strength two

✍ Scribed by Charles J. Colbourn; Sosina S. Martirosyan; Gary L. Mullen; Dennis Shasha; George B. Sherwood; Joseph L. Yucas

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 208 KB
Volume: 14
Category: Article
ISSN: 1063-8539
DOI: 10.1002/jcd.20065

No coin nor oath required. For personal study only.

✦ Synopsis

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 to cover all t‐sets of component interactions. The particular case when t = 2 (pairwise coverage) has been extensively studied, both to develop combinatorial constructions and to provide effective algorithmic search techniques. In this paper, a simple “cut‐and‐paste” construction is extended to covering arrays in which different columns (factors) admit different numbers of symbols (values); in the process an improved recursive construction for covering arrays with t = 2 is derived. © 2005 Wiley Periodicals, Inc. J Combin Designs 14: 124–138, 2006

📜 SIMILAR VOLUMES

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

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

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

Group construction of covering arrays

✍ Karen Meagher; Brett Stevens 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract A covering array __t__‐__CA__ (__n__, __k__, __g__) is a __k__ × __n__ array on a set of __g__ symbols with the property that in each __t__ × __n__ subarray, every __t__ × 1 column appears at least once. This paper improves many of the best known upper bounds on __n__ for covering array

Balanced arrays of strength two and nest

Balanced arrays of strength two and nested (r, λ)-designs

✍ Shinji Kuriki; Ryoh Fuji-Hara 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 375 KB

## Abstract An (__r__,λ)‐design with mutually balanced nested subdesigns (for brevity, (__r__,λ)‐design with MBN) is introduced firstly in this article. It is shown that an __r__,λ‐design with MBN is equivalent to a balanced array of strength 2 with __s__ symbols. By the use of a nested design and

Orthogonal arrays of strength 3

✍ Donald L. Kreher 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

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