Covering Arrays of Strength Three

M. A. Chateauneuf; Charles J. Colbourn; D. L. Kreher

doi:10.1023/A:1008379710317

Covering Arrays of Strength Three

M. A. Chateauneuf, Charles J. Colbourn, D. L. Kreher

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

55 Scopus citations

Abstract

A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

Original language	English (US)
Pages (from-to)	235-242
Number of pages	8
Journal	Designs, Codes, and Cryptography
Volume	16
Issue number	3
DOIs	https://doi.org/10.1023/A:1008379710317
State	Published - 1999
Externally published	Yes

Keywords

Covering array
Group action
Orthogonal array
Perfect hash family

ASJC Scopus subject areas

Computer Science Applications
Applied Mathematics

Access to Document

10.1023/A:1008379710317

Cite this

@article{d8fdf6b4b1c94134af7f2f3236385e20,

title = "Covering Arrays of Strength Three",

abstract = "A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.",

keywords = "Covering array, Group action, Orthogonal array, Perfect hash family",

author = "Chateauneuf, {M. A.} and Colbourn, {Charles J.} and Kreher, {D. L.}",

note = "Funding Information: Thanks to Brett Stevens and Jeff Dinitz for helpful discussions, and to Doug Stinson for helpful comments on the paper. The authors{\textquoteright} research is supported as follows: ARO grant DAAG55-98-1-0272 (Colbourn) and NSA grant MDA904-97-1-0072 (Kreher).",

year = "1999",

doi = "10.1023/A:1008379710317",

language = "English (US)",

volume = "16",

pages = "235--242",

journal = "Designs, Codes, and Cryptography",

issn = "0925-1022",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - Covering Arrays of Strength Three

AU - Chateauneuf, M. A.

AU - Colbourn, Charles J.

AU - Kreher, D. L.

N1 - Funding Information: Thanks to Brett Stevens and Jeff Dinitz for helpful discussions, and to Doug Stinson for helpful comments on the paper. The authors’ research is supported as follows: ARO grant DAAG55-98-1-0272 (Colbourn) and NSA grant MDA904-97-1-0072 (Kreher).

PY - 1999

Y1 - 1999

N2 - A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

AB - A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three.

KW - Covering array

KW - Group action

KW - Orthogonal array

KW - Perfect hash family

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

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

U2 - 10.1023/A:1008379710317

DO - 10.1023/A:1008379710317

M3 - Article

AN - SCOPUS:0142224807

SN - 0925-1022

VL - 16

SP - 235

EP - 242

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

IS - 3

ER -

Covering Arrays of Strength Three

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this