Group construction of covering arrays
Karen Meagher, Brett Stevens · Journal of Combinatorial Designs · 2004
Abstract A covering arrayt‐CA(n,k,g) is ak × narray on a set ofgsymbols with the property that in eacht × nsubarray, everyt × 1 column appears at least once. This paper improves many of the best known upper bounds onnfor covering arrays, 2‐CA(n,k,g) withg + 1 ≤ k ≤ 2g, forg = 3 · · · 12 by a construction which in many of these cases produces a 2‐CA(n,k,g) withn = k(g − 1) + 1. The construction is an extension of an algebraic method used by Chateauneuf, Colbourn, and Kreher which uses an array and a group action on the array. © 2004 Wiley Periodicals, Inc. J Combin Designs 13: 70–77, 2005.