𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Covering Arrays of Strength Three

✍ Scribed by M. A. Chateauneuf; Charles J. Colbourn; D. L. Kreher

Book ID
110263287
Publisher
Springer
Year
1999
Tongue
English
Weight
52 KB
Volume
16
Category
Article
ISSN
0925-1022

No coin nor oath required. For personal study only.

πŸ“œ 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

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

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

Group construction of covering arrays
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