This paper describes a new approach to testing that uses combinatorial designs to generate
tests that cover the pairwise, triple, or n-way combinations of a system's test parameters …

The starting point of this book is Sperner's theorem, which answers the question: What is the
maximum possible size of a family of pairwise (with respect to inclusion) subsets of a finite …

Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not
requiring that the appearance of t-tuples be balanced. Their uses in screening experiments …

The problem of error-free transmission capacity of a noisy channel was posed by Shannon
in 1956 and remains unsolved, Nevertheless, partial results for this and similar channel and …

In the 21 st century our society is becoming more and more dependent on software systems.
The safety of these systems and the quality of our lives is increasingly dependent on the …

A t-covering array is a collection of k vectors in a discrete space with the property that, in any
t coordinate positions, all combinations of the coordinate values occur at least once. Such …

In this paper we use coding theory to give simple explanations of some recent results on
universal hashing. We first apply our approach to give a precise and elegant analysis of the …

A t‐covering array is a set of k binary vectors of length n with the property that, in any t
coordinate positions, all 2t possibilities occur at least once. Such arrays are used for …

Combinatorial designs have long had substantial application in the statistical design of
experiments and in the theory of error-correcting codes. Applications in experimental and …

For discrete memoryless channels {W: X/spl rarr/Y} we consider decoders, possibly
suboptimal, which minimize a metric defined additively by a given function d (x, y)/spl ges/0 …