A covering array of size N, degree k, order v and strength t is a k × N array with entries from a set of v symbols such that in any t × N subarray every t × 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three
AbstractA q-ary t-covering array is an m×n matrix with entries from {0,1,…,q−1} with the property th...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
A covering array of size N, strength t, degree k, and order v is a k × N array on v symbols in which...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
International audienceA covering array CA(N ; t, k, v) of strength t is an N × k array of symbols fr...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
A covering array CA(N;t, k, v) is an N×k array with entries in {1,2,...,v}, for which every N×t suba...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
AbstractA q-ary t-covering array is an m×n matrix with entries from {0,1,…,q−1} with the property th...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
A covering array of size N, strength t, degree k, and order v is a k × N array on v symbols in which...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
International audienceA covering array CA(N ; t, k, v) of strength t is an N × k array of symbols fr...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
A covering array CA(N;t, k, v) is an N×k array with entries in {1,2,...,v}, for which every N×t suba...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
AbstractA q-ary t-covering array is an m×n matrix with entries from {0,1,…,q−1} with the property th...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
Software test suites based on the concept of interaction testing are very useful for testing softwar...
DOI
Add to ORKG