An improved graph-entropy bound for perfect hashing
IEEE International Symposium on Information Theory - Proceedings
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27775
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. © 1994 IEEE.
- Conference Paper