On the Connections Between Universal Hashing, Combinatorial Designs and Error-Correcting Codes

摘要

In this primarily expository paper, we discuss the connections between two popular and useful tools in theoretical computer science, namely, universal hashing and pairwise independent random variables; and classical combinatorial stuctures such as error-correcting codes, balanced incomplete block designs, difference matrices and orthogonal arrays.