Covering Arrays of Strength Three
Document Type
Article
Publication Date
1-1-1999
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.
Publication Title
Designs, Codes, and Cryptography
Recommended Citation
Chateauneuf, M.,
Colbourn, C.,
&
Kreher, D.
(1999).
Covering Arrays of Strength Three.
Designs, Codes, and Cryptography,
16(3), 235-242.
http://doi.org/10.1023/A:1008379710317
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/8229