An improved graph-entropy bound for perfect hashing

Thumbnail
Author(s)
Date
1994-06-07
Source Title
Proceedings of the International Symposium on Information Theory, IEEE 1994
Print ISSN
2157-8095
Publisher
IEEE
Pages
314
Language
English
Type
Conference Paper
Item Usage Stats
240
views
203
downloads
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.
Keywords
Upper bound
Information theory
Combinatorial mathematics
USA Councils
Permalink
http://hdl.handle.net/11693/27775
Published Version (Please cite this version)
http://dx.doi.org/10.1109/ISIT.1994.394704
Collections
Show full item record