On the state of strength-three covering arrays

Authors

M. Chateauneuf, University of Waterloo
D. L. Kreher, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

5-16-2002

Department

Department of Mathematical Sciences

Abstract

A covering array of size N, strength t, degree k, and order v is a k × N array on v symbols in which every t × N subarray contains every possible t × 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression.

Publisher's Statement

© 2002 Wiley Periodicals, Inc. Publisher’s version of record: https://doi.org/10.1002/jcd.10002

Publication Title

Journal of Combinatorial Designs

Recommended Citation

Chateauneuf, M., & Kreher, D. L. (2002). On the state of strength-three covering arrays. Journal of Combinatorial Designs, 10(4), 217-238. http://doi.org/10.1002/jcd.10002
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3702