Perfect hash families: Probabilistic methods and explicit constructions

DOI10.1006/jcta.1999.3050zbMath0962.68042OpenAlexW2013452001MaRDI QIDQ1586126

Simon R. Blackburn

Publication date: 14 November 2000

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1999.3050

zbMATH Keywords

perfect hash family

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of compilers and interpreters (68N20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (20)

Perfect Hash Families: Constructions and Existence ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Separating Hash Families: A Johnson-type bound and New Constructions ⋮ A sequence approach to linear perfect hash families ⋮ Generalised cumulative arrays in secret sharing ⋮ Roux-type constructions for covering arrays of strengths three and four ⋮ Improved bounds for separating hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Bounds for separating hash families ⋮ Some intriguing upper bounds for separating hash families ⋮ On generalized separating hash families ⋮ Geometric constructions of optimal linear perfect hash families ⋮ A bound on the size of separating hash families ⋮ Explicit constructions for perfect hash families ⋮ Linear hash families and forbidden configurations ⋮ Improving two recursive constructions for covering arrays ⋮ On the state of strength-three covering arrays

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit construction of exponential sized families of k-independent sets
• Probabilistic methods
• New bounds for perfect hashing via information theory
• On codes with the identifiable parent property
• Optimal linear perfect hash families
• Perfect hashing
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
• Efficient Multiplicative Sharing Schemes
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy

This page was built for publication: Perfect hash families: Probabilistic methods and explicit constructions