An improved graph-entropy bound for perfect hashing

View/Open

Full printable version (64.45Kb)

Author

Arikan, E.

Date Issued

1994

Journal Title

IEEE International Symposium on Information Theory - Proceedings

Language

English

Type

Conference Paper

Show full item record

Please cite this item using this persistent URL

http://hdl.handle.net/11693/27775

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. © 1994 IEEE.

Published as

http://dx.doi.org/10.1109/ISIT.1994.394704

Collections

Conference Paper [2294]