Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-052 | 4th October 1995 00:00

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

RSS-Feed

Abstract:

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.



ISSN 1433-8092 | Imprint