Abstract
Fredman and Komlós [1] 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Fredman and J. Komlós, “On the Size of Separating Systems and Perfect Hash Functions,” SIAM J. Algebraic Discrete Meth., 5, No. 1, pp. 61–68 (1984).
J. Kömer, “Fredman-Komlós Bounds and Information Theory, SIAM J. Algebraic Discrete Meth., 7, No. 4, pp. 560–570 (1986).
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.
J. Kömer and K. Marton, “New Bounds for Perfect Hashing via Information Theory,” submitted to Eur. J. Combinatorics.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag New York Inc.
About this chapter
Cite this chapter
Körner, J. (1987). The Information Theory of Perfect Hashing. In: Cover, T.M., Gopinath, B. (eds) Open Problems in Communication and Computation. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4808-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4808-8_4
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9162-6
Online ISBN: 978-1-4612-4808-8
eBook Packages: Springer Book Archive