Improved graph-entropy bound for perfect hashing
IEEE International Symposium on Information Theory - Proceedings
IEEE, Piscataway, NJ, United States
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/27776
We give 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.
- Work in Progress 653