AbstractA nested orthogonal array is an OA(N,k,s,g) which contains an OA(M,k,r,g) as a subarray. Here r<s and M<N. Necessary conditions for the existence of such arrays are obtained in the form of upper bounds on k, given N, M, s, r and g. Examples are given to show that these bounds are quite powerful in proving nonexistence. The link with incomplete orthogonal arrays is also indicated
AbstractIt is shown that several theorems in design theory are “translated” into those in orthogonal...
We developed an algorithm to search for new orthogonal arrays, OA(4rOA(4r, r12pr12p, 2), for odd r ....
It is shown that a signed orthogonal array SA<SUB>t</SUB>(v, k, λ) exists for all (v, k, λ, t), k ≥ ...
A nested orthogonal array is an OA(M,k,s,g) which contains an OA(M,k,r,g) as a subarray. Here r<s...
AbstractA nested orthogonal array is an OA(N,k,s,g) which contains an OA(M,k,r,g) as a subarray. Her...
AbstractFirst we prove that, if an incomplete orthogonal array (1, r, s, k, t) does exist, then s ⩾(...
AbstractAn orthogonal array OA(N, m, s, t) attaining the Rao [Factorial experiments derivable from c...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
AbstractIt is shown that a signed orthogonal array SAt(v, k, λ) exists for all (v, k, λ, t), k ⩾ t a...
AbstractIn this paper we show that the maximum possible number of constraints for a 2-level orthogon...
AbstractBy an OA(3,5,v) we mean an orthogonal array (OA) of order v, strength t=3, index unity and 5...
An orthogonal array OA(N, m, s, t) attaining the Rao [Factorial experiments derivable from combinato...
AbstractLet T(n x N) be a matrix with elements from the set of s integers {0,1…, s −1} Then T is sai...
We show that no orthogonal arrays OA(16A, 11,2,4) exist with A = 6 and 7. This solves an open proble...
AbstractThe main result of this paper is that for any pair of orthogonal Latin squares of side k, th...
AbstractIt is shown that several theorems in design theory are “translated” into those in orthogonal...
We developed an algorithm to search for new orthogonal arrays, OA(4rOA(4r, r12pr12p, 2), for odd r ....
It is shown that a signed orthogonal array SA<SUB>t</SUB>(v, k, λ) exists for all (v, k, λ, t), k ≥ ...
A nested orthogonal array is an OA(M,k,s,g) which contains an OA(M,k,r,g) as a subarray. Here r<s...
AbstractA nested orthogonal array is an OA(N,k,s,g) which contains an OA(M,k,r,g) as a subarray. Her...
AbstractFirst we prove that, if an incomplete orthogonal array (1, r, s, k, t) does exist, then s ⩾(...
AbstractAn orthogonal array OA(N, m, s, t) attaining the Rao [Factorial experiments derivable from c...
A new construction for orthogonal arrays of strength 3 is given. 1 Introduction An orthogonal array...
AbstractIt is shown that a signed orthogonal array SAt(v, k, λ) exists for all (v, k, λ, t), k ⩾ t a...
AbstractIn this paper we show that the maximum possible number of constraints for a 2-level orthogon...
AbstractBy an OA(3,5,v) we mean an orthogonal array (OA) of order v, strength t=3, index unity and 5...
An orthogonal array OA(N, m, s, t) attaining the Rao [Factorial experiments derivable from combinato...
AbstractLet T(n x N) be a matrix with elements from the set of s integers {0,1…, s −1} Then T is sai...
We show that no orthogonal arrays OA(16A, 11,2,4) exist with A = 6 and 7. This solves an open proble...
AbstractThe main result of this paper is that for any pair of orthogonal Latin squares of side k, th...
AbstractIt is shown that several theorems in design theory are “translated” into those in orthogonal...
We developed an algorithm to search for new orthogonal arrays, OA(4rOA(4r, r12pr12p, 2), for odd r ....
It is shown that a signed orthogonal array SA<SUB>t</SUB>(v, k, λ) exists for all (v, k, λ, t), k ≥ ...