Strength two covering arrays: Existence tables and projection

Research output: Contribution to journalArticle

36 Scopus citations

Abstract

A covering arrayCA (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 in experiments to screen for interactions among t-subsets of k components. Strength two covering arrays have been studied from numerous viewpoints, resulting in a variety of computational, direct, and recursive constructions. Consequently, it can be difficult to determine the smallest covering array that results from known construction. To address this, existence tables for the best currently known covering arrays are presented. In the process, a new direct construction from orthogonal arrays is also introduced.

Original languageEnglish (US)
Pages (from-to)772-786
Number of pages15
JournalDiscrete Mathematics
Volume308
Issue number5-6
DOIs
StatePublished - Mar 28 2008

Keywords

  • Covering array
  • Orthogonal array

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Strength two covering arrays: Existence tables and projection'. Together they form a unique fingerprint.

  • Cite this