This book is primarily a textbook introduction to various areas of discrete geometry. In each
area, it explains several key results and methods, in an accessible and concrete manner. It …

Software system faults are often caused by unexpected interactions among components. Yet
the size of a test suite required to test all possible combinations of interactions can be …

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 …

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 …

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 …

The identification of interaction faults in component-based systems has focused on
indicating the presence of faults, rather than their location and magnitude. While this is a …

Testing is an expensive but essential part of any software project. Having the right methods
to detect faults is a primary factor for success in the software industry. Component based …