An improved graph-entropy bound for perfect hashing

Series

Abstract

Gives an improved graph-entropy bound on the size of families of perfect hash functions. Examples are given illustrating that the new bound improves previous bounds in several instances.

Source Title

Proceedings of the International Symposium on Information Theory, IEEE 1994

Publisher

IEEE

Course

Other identifiers

Book Title

Degree Discipline

Degree Level

Degree Name

Citation

Published Version (Please cite this version)

Language

English