An improved graph-entropy bound for perfect hashing
Proceedings of the International Symposium on Information Theory, IEEE 1994
Item Usage Stats
MetadataShow full item record
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.