An improved graph-entropy bound for perfect hashing
Date
1994-06-07
Authors
Advisor
Instructor
Source Title
Proceedings of the International Symposium on Information Theory, IEEE 1994
Print ISSN
2157-8095
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
314
Language
English
Type
Conference Paper
Journal Title
Journal ISSN
Volume Title
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.
Course
Other identifiers
Book Title
Keywords
Upper bound, Information theory, Combinatorial mathematics, USA Councils