Hostname: page-component-78c5997874-j824f Total loading time: 0 Render date: 2024-11-05T21:39:48.696Z Has data issue: false hasContentIssue false
  • English
  • Français

Perfect Hashing and Probability

Published online by Cambridge University Press:  12 September 2008

A. Nilli
A. Nilli
Affiliation:
c/o N. Alon, Department of Mathematics, Tel Aviv University, Tel Aviv, Israel
Get access Rights & Permissions [Opens in a new window]

Abstract

A simple proof is given of the best-known upper bound on the cardinality of a set of vectors of length t over an alphabet of size b, with the property that, for every subset of k vectors, there is a coordinate in which they all differ. This question is motivated by the study of perfect hash functions.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 3 , Issue 3 , September 1994 , pp. 407 - 409
Copyright
Copyright © Cambridge University Press 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Alon, N. and Spencer, J. H. (1991) The Probabilistic Method, Wiley.Google Scholar
[2]Fredman, M. and Komlós, J. (1984) On the size of separating systems and perfect hash functions. SIAM J. Algebraic and Disc. Meth. 5 61–68.CrossRefGoogle Scholar
[3]Hardy, G. H., Littlewood, J. E. and Polya, G. (1952) Inequalities, 2nd Edition, Cambridge University Press.Google Scholar
[4]Körner, J. (1986) Fredman-Komlós bounds and information theory. SIAM J. Algebraic and Disc. Meth. 7 560–570.CrossRefGoogle Scholar
[5]Körner, J. and Marton, K. (1988) New bounds for perfect hashing via information theory. Europ. J. Combinatorics 9 523–530.CrossRefGoogle Scholar