An improved graph-entropy bound for perfect hashing
Author:
- 1 January 1994
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 314
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
This publication has 4 references indexed in Scilit:
- On the capacity of uniform hypergraphsIEEE Transactions on Information Theory, 1990
- New Bounds for Perfect Hashing via Information TheoryEuropean Journal of Combinatorics, 1988
- Fredman–Komlós bounds and information theorySIAM Journal on Algebraic Discrete Methods, 1986
- On the Size of Separating Systems and Families of Perfect Hash FunctionsSIAM Journal on Algebraic Discrete Methods, 1984