Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||James F. Lawrence; Raghu N. Kacker; Yu Lei; David R. Kuhn; Michael Forbes;|
|Title:||A Survey of Binary Covering Arrays|
|Published:||April 07, 2011|
|Abstract:||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|
|Keywords:||combinatorial testing,covering array,orthogonal array,qualitative independence|
|PDF version:||Click here to retrieve PDF version of paper (309KB)|