An improved graph-entropy bound for perfect hashing

Files
An improved graph-entropy bound for perfect hashing.pdf (64.46 KB)
Date
1994-06-07
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
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
Series
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
Citation
Permalink
http://hdl.handle.net/11693/27775
Published Version (Please cite this version)
http://dx.doi.org/10.1109/ISIT.1994.394704
Collections
Department of Electrical and Electronics Engineering