An improved graph-entropy bound for perfect hashing
Author
Arıkan, Erdal
Date
1994-06-07Source Title
Proceedings of the International Symposium on Information Theory, IEEE 1994
Print ISSN
2157-8095
Publisher
IEEE
Pages
314.
Language
English
Type
Conference PaperItem Usage Stats
156
views
views
108
downloads
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.