Products of mixed covering arrays of strength two | Zendy

Colbourn Charles J. | Zendy; Martirosyan Sosina S. | Zendy; Mullen Gary L. | Zendy; Shasha Dennis | Zendy; Sherwood George B. | Zendy; Yucas Joseph L. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Products of mixed covering arrays of strength two

Author(s) -

Colbourn Charles J.,

Martirosyan Sosina S.,

Mullen Gary L.,

Shasha Dennis,

Sherwood George B.,

Yucas Joseph L.

Publication year - 2006

Publication title -

journal of combinatorial designs

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.618

H-Index - 34

eISSN - 1520-6610

pISSN - 1063-8539

DOI - 10.1002/jcd.20065

Subject(s) - combinatorics , cover (algebra) , mathematics , simple (philosophy) , pairwise comparison , tuple , row , discrete mathematics , computer science , statistics , engineering , database , mechanical engineering , philosophy , epistemology

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

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research