A covering array of size N, strength t, degree k, and order v is a k × N array on v symbols in which every t × N subarray contains every possible t × 1 column at least once. We present explicit constructions, constructive upper bounds on the size of various covering arrays, and compare our results with those of a commercial product. Applications of covering arrays include software testing, drug screening, and data compression
This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Co...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
A covering array of size N, degree k, order v and strength t is a k × N array with entries from a se...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
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 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...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
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...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
AbstractA q-ary t-covering array is an m×n matrix with entries from {0,1,…,q−1} with the property th...
This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Co...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
A covering array of size N, degree k, order v and strength t is a k × N array with entries from a se...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
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 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...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
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...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
AbstractA q-ary t-covering array is an m×n matrix with entries from {0,1,…,q−1} with the property th...
This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Co...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
DOI
Add to ORKG