On the connections between universal hashing, combinatorial designs and error-correcting codes. Congressus Numerantium 114 (1996) [10 citations — 0 self]
Download:
|
|
by D. R. Stinson
In Proc. Congressus Numerantium 114
http://cacr.math.uwaterloo.ca/~dstinson/papers/manitoba.ps
Add To MetaCart
Abstract:
Dedicated to Ralph Stanton on the occasion of his 70th birthday 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. 1
Citations
| 30 | On families of hash functions via geometric codes and concatenation – Bierbrauer, Johansson, et al. - 1994 |
| 5 | Universal hashing and geometric codes – Bierbrauer - 1997 |
