This project will look at a construction of strength 3 covering ar-rays developed by Chateauneuf, Colburn and Kreher. This construc-tion uses a subarray of a covering array and a group action on that subarray. 1 Introduction and Denitions Covering arrays are very interesting and useful designs that have been widely studied They are closely related to orthogonal arrays. They are also related to interesting mathematical structures, like set systems and intersecting codes. There are also many applications of coverin
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have a...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
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...
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...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
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 cover starter is a single vector that yields a covering array under the actions of groups ...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have a...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Recently, covering arrays have been the subject of considerable research attention as they hold both...
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...
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...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering a...
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 cover starter is a single vector that yields a covering array under the actions of groups ...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
AbstractThe minimum number of rows in covering arrays (equivalently, surjective codes) and radius-co...
Covering arrays are combinatorial structures which extend the notion of orthogonal arrays and have a...
AbstractA covering array CA(N;t,k,v) is an N×k array such that every N×t sub-array contains all t-tu...
Recently, covering arrays have been the subject of considerable research attention as they hold both...