Cover starters for covering arrays of strength two

Jason R. Lobb; Charles Colbourn; Peter Danziger; Brett Stevens; Jose Torres-Jimenez

doi:10.1016/j.disc.2011.10.026

Cover starters for covering arrays of strength two

Jason R. Lobb, Charles Colbourn, Peter Danziger, Brett Stevens, Jose Torres-Jimenez

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

Abstract

A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering arrays on fewer symbols. Lower bounds on the length of cover starters over specified groups are established, and extensive computational results are developed to improve upper bounds for numerous covering array numbers.

Original language	English (US)
Pages (from-to)	943-956
Number of pages	14
Journal	Discrete Mathematics
Volume	312
Issue number	5
DOIs	https://doi.org/10.1016/j.disc.2011.10.026
State	Published - Mar 6 2012

Keywords

Cover starter
Covering array
Interaction testing

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.10.026

Cite this

@article{347acb60f7294206ac3c3c89932031a0,

title = "Cover starters for covering arrays of strength two",

abstract = "A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering arrays on fewer symbols. Lower bounds on the length of cover starters over specified groups are established, and extensive computational results are developed to improve upper bounds for numerous covering array numbers.",

keywords = "Cover starter, Covering array, Interaction testing",

author = "Lobb, {Jason R.} and Charles Colbourn and Peter Danziger and Brett Stevens and Jose Torres-Jimenez",

year = "2012",

month = mar,

day = "6",

doi = "10.1016/j.disc.2011.10.026",

language = "English (US)",

volume = "312",

pages = "943--956",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "5",

}

TY - JOUR

T1 - Cover starters for covering arrays of strength two

AU - Lobb, Jason R.

AU - Colbourn, Charles

AU - Danziger, Peter

AU - Stevens, Brett

AU - Torres-Jimenez, Jose

PY - 2012/3/6

Y1 - 2012/3/6

N2 - A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering arrays on fewer symbols. Lower bounds on the length of cover starters over specified groups are established, and extensive computational results are developed to improve upper bounds for numerous covering array numbers.

AB - A cover starter is a single vector that yields a covering array under the actions of groups on both the columns and the symbols of the starter. The existence of this compact representation of covering arrays facilitates effective exhaustive and heuristic search. When the group action on symbols fixes a small number f of symbols, such cover starters lead to covering arrays that embed covering arrays on fewer symbols. Lower bounds on the length of cover starters over specified groups are established, and extensive computational results are developed to improve upper bounds for numerous covering array numbers.

KW - Cover starter

KW - Covering array

KW - Interaction testing

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

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

U2 - 10.1016/j.disc.2011.10.026

DO - 10.1016/j.disc.2011.10.026

M3 - Article

AN - SCOPUS:84855534953

SN - 0012-365X

VL - 312

SP - 943

EP - 956

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 5

ER -

Cover starters for covering arrays of strength two

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this