Constructions of new orthogonal arrays and covering arrays of strength three

Abstract: A covering array of size N, strength t, degree k, and order v, or a in short, is a array on v symbols. In every subarray, each t-tuple column vector occurs at least once. When ‘at least’ is replaced by ‘exactly’, this defines an orthogonal array, . A difference covering array, or a , over an abelian group G of order v is a array (, ) with entries from G, such that, for any two distinct rows l and h of D (), the difference list contains every element of G at least once. Covering arrays have important applications in statistics and computer science, as well as in drug screening. In this paper, we present two constructive methods to obtain orthogonal arrays and covering arrays of strength 3 by using DCAs. As a consequence, it is proved that there are an for any integer and (mod 4), and an for any positive integer v satisfying and . It is also proved that the size of a cannot exceed when and (mod 4), or , (mod 4) and . [Copyright &y& Elsevier]