A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Covering arrays are used to generate software test suites to cover all t-sets of component interactions. Recursive constructions for covering arrays of strengths 3 and 4 are developed, generalizing many "Roux-type" constructions. A numerical comparison with current construction techniques is given through existence tables for covering arrays
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
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 of size N, degree k, order v and strength t is a k × N array with entries from a se...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Co...
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...
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...
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...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...
A covering array CA(N; t; k; v) is an N k array such that every N t sub-array contains all t-tuple...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
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 of size N, degree k, order v and strength t is a k × N array with entries from a se...
Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiri...
This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Co...
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...
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...
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...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
A covering array of strength t on v symbols is an array with the property that, for every t-set of c...