A Survey of Binary Covering Arrays
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 applica...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Electronic Journal of Combinatorics
2014
|
Online Access: | http://hdl.handle.net/1721.1/89799 |