Covering arrays of higher strength from permutation vectors

George B. Sherwood; Sosina S. Martirosyan; Charles Colbourn

doi:10.1002/jcd.20067

Covering arrays of higher strength from permutation vectors

George B. Sherwood, Sosina S. Martirosyan, Charles Colbourn

Computer Science and Engineering

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

48 Scopus citations

Abstract

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. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found.

Original language	English (US)
Pages (from-to)	202-213
Number of pages	12
Journal	Journal of Combinatorial Designs
Volume	14
Issue number	3
DOIs	https://doi.org/10.1002/jcd.20067
State	Published - May 1 2006

Keywords

Covering array
Orthogonal array
Perfect hash family
Permutation vector

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1002/jcd.20067

Cite this

@article{d2706d4957ef4e7ca78a00727724d01d,

title = "Covering arrays of higher strength from permutation vectors",

abstract = "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. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found.",

keywords = "Covering array, Orthogonal array, Perfect hash family, Permutation vector",

author = "Sherwood, {George B.} and Martirosyan, {Sosina S.} and Charles Colbourn",

year = "2006",

month = may,

day = "1",

doi = "10.1002/jcd.20067",

language = "English (US)",

volume = "14",

pages = "202--213",

journal = "Journal of Combinatorial Designs",

issn = "1063-8539",

publisher = "John Wiley and Sons Inc.",

number = "3",

}

TY - JOUR

T1 - Covering arrays of higher strength from permutation vectors

AU - Sherwood, George B.

AU - Martirosyan, Sosina S.

AU - Colbourn, Charles

PY - 2006/5/1

Y1 - 2006/5/1

N2 - 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. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found.

AB - 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. We introduce a combinatorial technique for their construction, focussing on covering arrays of strength 3 and 4. With a computer search, covering arrays with improved parameters have been found.

KW - Covering array

KW - Orthogonal array

KW - Perfect hash family

KW - Permutation vector

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

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

U2 - 10.1002/jcd.20067

DO - 10.1002/jcd.20067

M3 - Article

AN - SCOPUS:33646378462

VL - 14

SP - 202

EP - 213

JO - Journal of Combinatorial Designs

JF - Journal of Combinatorial Designs

SN - 1063-8539

IS - 3

ER -

Covering arrays of higher strength from permutation vectors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this