Title :
An improved graph-entropy bound for perfect hashing
Author_Institution :
Dept. of Electr. Eng., Bilkent Univ., Ankara, Turkey
fDate :
27 Jun-1 Jul 1994
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 :
cryptography; entropy; file organisation; graph theory; sequences; family size; improved graph-entropy bound; perfect hashing; Combinatorial mathematics; Information theory; USA Councils; Upper bound;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394704
