1 research outputs found
Improved Strength Four Covering Arrays with Three Symbols
A covering array -, of size , strength , degree , and
order , is a array on symbols such that every
sub-array contains every column on symbols at least once.
Covering arrays have been studied for their applications to software testing,
hardware testing, drug screening, and in areas where interactions of multiple
parameters are to be tested. In this paper, we present an algebraic
construction that improves many of the best known upper bounds on for
covering arrays 4- with . The
of a testing array is defined by the ratio between the number of distinct
-tuples contained in the column vectors of and the total number of
-tuples. A covering array is a testing array with full coverage. The
is the problem of
constructing a testing array of size at most having largest possible
coverage measure, given values of and . This paper presents several
strength four testing arrays with high coverage. The construction here is a
generalisation of the construction methods used by Chateauneuf, Colbourn and
Kreher, and Meagher and Stevens