Optimal Linear Perfect Hash Families

LetVbe a set of ordernand letFbe a set of orderq. A setS⊆{φ:V→F} of functions fromVtoFis an (n,q,t)-perfect hash familyif for allX⊆Vwith |X|=t, there existsφ∈Swhich is injective when restricted toX. Perfect hash families arise in compiler design, in circuit complexity theory and in cryptography. Let...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial theory. Series A Vol. 83; no. 2; pp. 233 - 250
Main Authors Blackburn, Simon R, Wild, Peter R
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.08.1998
Online AccessGet full text

Cover

More Information
Summary:LetVbe a set of ordernand letFbe a set of orderq. A setS⊆{φ:V→F} of functions fromVtoFis an (n,q,t)-perfect hash familyif for allX⊆Vwith |X|=t, there existsφ∈Swhich is injective when restricted toX. Perfect hash families arise in compiler design, in circuit complexity theory and in cryptography. LetSbe an (n,q,t)-perfect hash family. The paper provides lower bounds on |S|, which better previously known lower bounds for many parameter sets. The paper exhibits new classes of perfect hash families which show that these lower bounds are realistic.
ISSN:0097-3165
1096-0899
DOI:10.1006/jcta.1998.2876