On the state of strength-three covering arrays
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. © 2002 Wiley Periodicals, Inc.
Journal of Combinatorial Designs
On the state of strength-three covering arrays.
Journal of Combinatorial Designs,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3702