A Survey of Binary Covering Arrays

Published: April 07, 2011


James F. Lawrence, Raghu N. Kacker, Yu Lei, David R. Kuhn, Michael Forbes


Two-valued covering arrays of strength t are 0--1 matrices having the property that for each t columns and each of the possible 2t sequences of t 0's and 1's, there exists a row having that sequence in that set of t columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the application, and it is desirable to have a covering array with a small number of rows. Here we survey some of what is known about the existence and production of two-valued covering arrays.
Citation: Electronic Journal of Combinatorics
Volume: 18
Issue: 1
Pub Type: Journals

Download Paper


combinatorial testing, covering array, orthogonal array, qualitative independence
Created April 07, 2011, Updated February 19, 2017