Strength two covering arrays: Existence tables and projection

Research output: Contribution to journalArticle

34 Citations (Scopus)

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

Fingerprint

Covering Array
Tables
Projection
Orthogonal Array
Covering
Subset
Experiments
Interaction
Experiment

Keywords

  • Covering array
  • Orthogonal array

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Strength two covering arrays : Existence tables and projection. / Colbourn, Charles.

In: Discrete Mathematics, Vol. 308, No. 5-6, 28.03.2008, p. 772-786.

Research output: Contribution to journalArticle

@article{aea8ff7c94414020a8d1cd63de7b08af,
title = "Strength two covering arrays: Existence tables and projection",
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.",
keywords = "Covering array, Orthogonal array",
author = "Charles Colbourn",
year = "2008",
month = "3",
day = "28",
doi = "10.1016/j.disc.2007.07.050",
language = "English (US)",
volume = "308",
pages = "772--786",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "5-6",

}

TY - JOUR

T1 - Strength two covering arrays

T2 - Existence tables and projection

AU - Colbourn, Charles

PY - 2008/3/28

Y1 - 2008/3/28

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

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

KW - Covering array

KW - Orthogonal array

UR - http://www.scopus.com/inward/record.url?scp=38049115622&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38049115622&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2007.07.050

DO - 10.1016/j.disc.2007.07.050

M3 - Article

AN - SCOPUS:38049115622

VL - 308

SP - 772

EP - 786

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 5-6

ER -