Skip to main content
U.S. flag

An official website of the United States government

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.

A Survey of Binary Covering Arrays

Published

Author(s)

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.
Citation
Electronic Journal of Combinatorics
Volume
18
Issue
1

Keywords

combinatorial testing, covering array, orthogonal array, qualitative independence

Citation

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 December 5, 2022)
Created April 7, 2011, Updated February 19, 2017