A Survey of Binary Covering Arrays
Name
Lawrence-2011-Survey of binary.pdf
Size
256.14 KB
Format
Adobe PDF
Checksum (MD5)
c915e11f3d849c65d47db2b3dd625d02
Author(s)
Lawrence, Jim
Kacker, Raghu N.
Lei, Yu
Kuhn, D. Richard
Forbes, Michael
Date Issued
April 2011
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Lawrence, Jim, Raghu N. Kacker, Yu Lei, D. Richard Kuhn, and Michael Forbes. "A Survey of Binary Covering Arrays." Electronic Journal of Combinatorics, Volume 18, Issue 1 (2011).
Version
Final published version
Abstract
Binary covering arrays of strength t are 0–1 matrices having the property that for each t columns and each of the possible 2[superscript t] 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 of binary covering arrays and methods of producing them, including both explicit constructions and search techniques.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/571
