Products of mixed covering arrays of strength two

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

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)124-138
Number of pages15
JournalJournal of Combinatorial Designs
Issue number2
StatePublished - Mar 2006


  • Covering array
  • Latin square
  • Orthogonal array

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Products of mixed covering arrays of strength two'. Together they form a unique fingerprint.

Cite this