𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the state of strength-three covering arrays

✍ Scribed by M. Chateauneuf; D. L. Kreher

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
194 KB
Volume
10
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

✦ Synopsis

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 of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression. Β© 2002 Wiley Periodicals, Inc. J Combin Designs 10: 217–238, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10002

πŸ“œ SIMILAR VOLUMES

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

On the Bound State of three Particles
On the Bound State of three Particles
✍ B. N. Zakhariev; R. K. Kalinauskas πŸ“‚ Article πŸ“… 1965 πŸ› John Wiley and Sons 🌐 English βš– 305 KB πŸ‘ 2 views
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