Explicit constructions for perfect hash families
From MaRDI portal
Publication:1008968
DOI10.1007/s10623-007-9138-6zbMath1185.05020OpenAlexW1989558192MaRDI QIDQ1008968
Tran van Trung, Sosina S. Martirosyan
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9138-6
Related Items (11)
Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Improved bounds for separating hash families ⋮ Linear Time Constructions of Some $$d$$-Restriction Problems ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Bounds for separating hash families ⋮ Fractal perfect hash families (extended abstract) ⋮ A recursive construction for perfect hash families ⋮ Linear hash families and forbidden configurations ⋮ Improving two recursive constructions for covering arrays ⋮ Distributing hash families with few rows
Cites Work
- Roux-type constructions for covering arrays of strengths three and four
- Explicit construction of exponential sized families of k-independent sets
- New bounds for perfect hashing via information theory
- Optimal linear perfect hash families
- Perfect hashing
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Perfect hash families: Probabilistic methods and explicit constructions
- New constructions for IPP codes
- On \(t\)-covering arrays
- A sequence approach to linear perfect hash families
- Recursive constructions of secure codes and hash families using difference function families.
- Efficient Multiplicative Sharing Schemes
- On the Size of Separating Systems and Families of Perfect Hash Functions
- On the state of strength-three covering arrays
- Perfect Hash Families: Constructions and Existence
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Explicit constructions for perfect hash families