The Information Theory of Perfect Hashing
- 398 Downloads
Fredman and Komlós  have used an interesting information-theoretic technique to derive the hitherto sharpest converse (nonexistence) bounds for the problem of perfect hashing. It seems to me that this is the first use of “hard core information theory” in combinatorics.
KeywordsInformation Theory Hash Function Random Selection Hungarian Academy Proof Technique
Unable to display preview. Download preview PDF.
- J. Kömer, “Coding of an Information Source Having Ambiguous Alphabet and the Entropy of Graphs,” Transactions of the 6th Prague Conference on Information Theory, Academia, Prague 1973, pp. 411–425.Google Scholar
- J. Kömer and K. Marton, “New Bounds for Perfect Hashing via Information Theory,” submitted to Eur. J. Combinatorics.Google Scholar