Abstract. We obtain restrictions on the structure of binary orthogonal arrays of strength 5 under the assumption that their covering radius is close to the Fazekas-Levenshtein bound. We obtain lower and upper bounds on the number of the points of the array which are closest to a point of realization of the covering radius.
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
The problem of embedding an orthogonal array of strength 2 into a complete orthogonal array is discu...
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...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
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...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
The paper attempts to construct all orthogonal arrays of strength three and size 2r. Methods for con...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
The problem of embedding an orthogonal array of strength 2 into a complete orthogonal array is discu...
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...
A covering array CA(N; t, k, v) of strength t is an N × k array of symbols from an alphabet of size ...
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...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
The paper attempts to construct all orthogonal arrays of strength three and size 2r. Methods for con...
The only known general bounds on the parameters of orthogonal arrays are those given by Rao in 1947 ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in ...
Orthogonal arrays (OAs) are basic combinatorial structures, which appear under various disguises in...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
We generate all the Orthogonal Arrays (OAs) of a given size n and strength t as the union of a colle...
AbstractA covering array of size N, strength t, degree k, and order v, or a CA(N;t,k,v) in short, is...
Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not requirin...
The problem of embedding an orthogonal array of strength 2 into a complete orthogonal array is discu...