Results 1 
5 of
5
Covering Arrays of Strength Three
 Des. Codes Cryptogr
, 1998
"... A covering array of size N , degree k, order v and strength t is a k \Theta N array with entries from a set of v symbols such that in any t \Theta N subarray every t \Theta 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
A covering array of size N , degree k, order v and strength t is a k \Theta N array with entries from a set of v symbols such that in any t \Theta N subarray every t \Theta 1 column occurs at least once. Covering arrays have been studied for their applications to drug screening and software testing. We present explicit constructions and give constructive upper bounds for the size of a covering array of strength three. Keywords: covering array, orthogonal array, group action, perfect hash family. 1 Introduction A covering array of size N , degree k, order v and strength t is a k \Theta N array with entries from a set of v symbols such that in any t \Theta N subarray every t \Theta 1 column occurs at least once. We denote such an array by CA(N ; t; k; v). The covering array number CAN(t; k; v) is the fewest columns N in a CA(N ; t; k; v). An obvious lower bound is: v t CAN(t; k; v): (1) Suppose A is a covering array of type CA(N ; t; k; v) and let i be any row and x any symbol. T...
unknown title
, 1999
"... To appear in JSPI (1999). Orthogonal arrays of strength three from regular 3wise balanced designs ..."
Abstract
 Add to MetaCart
(Show Context)
To appear in JSPI (1999). Orthogonal arrays of strength three from regular 3wise balanced designs
Orthogonal Arrays of Strength Three From Regular 3Wise Balanced Designs
, 1999
"... The construction given in [4] is extended to obtain new infinite families of orthogonal arrays of strength 3. Regular 3wise balanced designs play a central role in this construction. 1 Introduction An orthogonal array of size N , with k constraints (or of degree k), s levels (or of order s), and ..."
Abstract
 Add to MetaCart
(Show Context)
The construction given in [4] is extended to obtain new infinite families of orthogonal arrays of strength 3. Regular 3wise balanced designs play a central role in this construction. 1 Introduction An orthogonal array of size N , with k constraints (or of degree k), s levels (or of order s), and strength t, denoted OA(N; k; s; t), is a k \Theta N array with entries from a set of s 2 symbols, having the property that in every t \Theta N submatrix, every t \Theta 1 column vector appears the same number = N=s t times. The parameter is the index of the orthogonal array. An OA(N; k; s; t) is also denoted by OA (t; k; s); in this notation, if t is omitted it is understood to be 2, and if is omitted it is understood to be 1. A parallel class in an OA (t; k; s) is a set of s columns so that each row contains all s symbols within these s columns. A resolution of the orthogonal array is a partition of its columns into parallel classes, and an OA with such a resolution is termed r...
Probability Commons Published in Journal of Statistical Planning and Inference, 100(2), 191195. This Article is brought to you for free and open access by the Department of Mathematics at OpenSIUC. It has been accepted for inclusion in Articles
"... Orthogonal arrays of strength three from regular 3wise balanced designs ..."
(Show Context)