A survey of binary covering arrays
Summary: Binary covering arrays of strength \(t\) are 0-1 matrices having the property that for each \(t\) columns and each of the possible \(2^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.
- A survey of methods for constructing covering arrays
- Structures and lower bounds for binary covering arrays
- A survey on the problems and algorithms for covering arrays via set covers
- Binary consecutive covering arrays
- Problems and algorithms for covering arrays
- Covering and radius-covering arrays: constructions and classification
- Upper bounds for covering arrays by tabu search.
- Partial covering arrays for data hiding and quantization
- New covering array numbers
- Suitable sets of permutations, packings of triples, and Ramsey's theorem
- Factorials experiments, covering arrays, and combinatorial testing
- Arrays for combinatorial interaction testing: a review on constructive approaches
- A survey on the problems and algorithms for covering arrays via set covers
- Binary consecutive covering arrays
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays
- Suitable permutations, binary covering arrays, and Paley matrices
- Chromatic numbers of copoint graphs of convex geometries
- Structures and lower bounds for binary covering arrays
- New optimal covering arrays using an orderly algorithm
- Constructions and nonexistence results for suitable sets of permutations
- Non-uniform covering array with symmetric forbidden edge constraints
- Binary Covering Arrays and Existentially Closed Graphs
- Forbidden configurations and repeated induction
- k-independent Boolean networks
- Lower bounds and construction of detecting arrays
- A classification of invariant sets of constant-weight tuples and applications to covering schemes
- Attribute-efficient learning of Boolean functions from Post closed classes
This page was built for publication: A survey of binary covering arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q540079)
