Perfect Hash Families: Probabilistic Methods and Explicit Constructions

Journal of Combinatorial Theory. Series A

Volumn 92, Issue 1, 2000, Pages 54-60

  Blackburn, Simon R ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Perfect hash families; Probabilistic methods

Indexed keywords

EID: 0347112387     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.1999.3050     Document Type: Article

References (16)

1. Alon N. Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58:1986;191-193.
2. Alon N., Naor M. Rerandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica. 16:1996;434-449.
3. Atici M., Magliveras S. S., Stinson D. R., Wei W.-D. Some recursive constructions for perfect hash families. J. Combin. Des. 4:1996;353-363.
4. Blackburn S. R. Combinatorics and threshold cryptography. Holroyd F. C., Quinn K. A. S., Rowley C., Webb B. S. Combinatorial Designs and Their Applications. Research Notes in Mathematics. 403:1999;44-70 CRC Press, London.
5. Blackburn S. R., Burmester M., Desmedt Y., Wild P. R. Efficient multiplicative sharing schemes. Maurer U. Advances in Cryptology - EUROCRYPT '96. Lecture Notes in Computer Science. 1070:1996;107-118 Springer-Verlag, Berlin.
6. Blackburn S. R., Wild P. R. Optimal linear perfect hash families. J. Combin. Theory Ser. A. 83:1998;233-250.
7. Czech Z. J., Havas G., Majewski B. S. Perfect hashing. Theoret. Comput. Sci. 182:1997;1-143.
8. Erdos P., Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions. Hajnal A., Rado R., Sós V. Infinite and Finite Sets. Colloquium Math. Soc. Janos Bolyai. 11:1975;609-627 North-Holland, Amsterdam.
9. Fredman M. L., Komlós J. On the size of separating systems and families of perfect hash functions. SIAM J. Alg. Discrete Methods. 5:1984;61-68.
10. Hollmann H. D. L., van Lint J. H., Linnartz J.-P., Tolhuizen L. M. G. M. On codes with the identifiable parent property. J. Combin. Theory Ser. A. 82:1998;121-133.
11. Korner J., Marton. New bounds for perfect hashing via information theory. European J. Combin. 9:1988;523-530.
12. Mehlhorn K. Data Structures and Algorithms. 1. Sorting and Searching. 1984;Springer-Verlag, Berlin.
13. Newman I., Wigderson A. Lower bounds on formula size of Boolean functions using hypergraph entropy. SIAM J. Discrete Math. 8:1995;536-542.
14. Spencer J. Probabilistic methods. Graphs Combin. 1:1985;357-382.
15. D. R. Stinson, T. van Trung, and, R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statist. Plann. Inference, in press.
16. D. R. Stinson, R. Wei, and, L. Zhu, New constructions for perfect hash families and related structures using combinatorial designs and codes, J. Combin. Designs, to appear.