Orthogonal arrays (OAs) are basic combinatorial structures, originally studied by statisticians motivated by their applications to design of experiments. In recent years, they have found numerous applications in computer science. Among their applications are derandomization of algorithms, random pattern testing of VLSI chips, authentication codes, universal hash functions, threshold schemes, and perfect local randomizers. In this article, we survey the applications of orthogonal arrays to computer science. keywords: Orthogonal Arrays, Computer Science, Cryptography, Applications.
Download Full PDF Version (Non-Commercial Use)