NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.
Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.
An official website of the United States government
Here’s how you know
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
James F. Lawrence, Raghu N. Kacker, Yu Lei, David R. Kuhn, Michael Forbes
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.
Lawrence, J.
, Kacker, R.
, Lei, Y.
, Kuhn, D.
and Forbes, M.
(2011),
A Survey of Binary Covering Arrays, Electronic Journal of Combinatorics, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=51256
(Accessed October 13, 2025)