Roux-type constructions for covering arrays of strengths three and four

Charles Colbourn, Sosina S. Martirosyan, Tran Van Trung, Robert A. Walker

Research output: Contribution to journalArticlepeer-review

50 Scopus citations


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 of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many "Roux-type" constructions. A numerical comparison with current construction techniques is given through existence tables for covering arrays.

Original languageEnglish (US)
Pages (from-to)33-57
Number of pages25
JournalDesigns, Codes, and Cryptography
Issue number1
StatePublished - Oct 2006


  • Covering array
  • Difference matrix
  • Orthogonal array

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Computer Science Applications


Dive into the research topics of 'Roux-type constructions for covering arrays of strengths three and four'. Together they form a unique fingerprint.

Cite this