Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Peter Bro Miltersen · 1998
We consider dictionaries of size n over the finite universe U = and introduce a new technique for their implementation: error correcting codes. The use of such codes makes it possible to replace the use of strong forms of hashing, such as universal hashing, with much weaker forms, such as clustering. We use