Products of mixed covering arrays of strength two

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

Full description

Saved in:
Bibliographic Details
Published in:Journal of combinatorial designs 2006-03, Vol.14 (2), p.124-138
Main Authors: Colbourn, Charles J., Martirosyan, Sosina S., Mullen, Gary L., Shasha, Dennis, Sherwood, George B., Yucas, Joseph L.
Format: Article
Language:English
Subjects:
covering array
latin square
orthogonal array
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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
ISSN:1063-8539
1520-6610
DOI:10.1002/jcd.20065