A t-covering array is a set of k binary vectors of length n with the property that, in any t coor- dinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, …

Apr 17, 2008 · Covering arrays and the ACTS project: The tables of covering arrays that are accessible from this website are maintained as part of the Automated Combinatorial Testing for Software …

In the combinatorial approach to input data selection, a test data generation tool is used to cover all combinations of input values up to some specified limit.

One of the best constructions for 3-covering arrays (due to Busschbach [8]) makes use of “intersecting codes,” and Section 2 is devoted to these codes. The cases t 2 4 (and q 2 2) will not be discussed here.

Dec 31, 1992 · TL;DR: The properties of 3-covering arrays and intersecting codes are studied, and a table of the best 3- covering arrays presently known is given.

A t-covering array is a set of k binary vectors of length n with the property that, in any t coordinate positions, all 2t possibilities occur at least once. Such arrays are used for example in circuit testing, …

Covering arrays are easier to construct and can be smaller then Orthogonal Arrays while still testing as much. Let's start with a basic example. First up a demonstration on the difference between Covering …