Explicit constructions for perfect hash families

DOI10.1007/S10623-007-9138-6MaRDI QIDQ1008968zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

perfect hash familyrecursive constructionPFH

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Recommendations

• Perfect Hash Families: Constructions and Existence
• Perfect hash families: Probabilistic methods and explicit constructions
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• Optimal linear perfect hash families
• scientific article; zbMATH DE number 1228785

Cites work

• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 1228785 (Why is no real title available?)
• scientific article; zbMATH DE number 1284201 (Why is no real title available?)
• scientific article; zbMATH DE number 1024079 (Why is no real title available?)
• scientific article; zbMATH DE number 1462939 (Why is no real title available?)
• scientific article; zbMATH DE number 1759787 (Why is no real title available?)
• A sequence approach to linear perfect hash families
• Efficient Multiplicative Sharing Schemes
• Explicit construction of exponential sized families of k-independent sets
• Explicit constructions of perfect hash families from algebraic curves over finite fields
• New bounds for perfect hashing via information theory
• New constructions for IPP codes
• On \(t\)-covering arrays
• On the Size of Separating Systems and Families of Perfect Hash Functions
• On the state of strength-three covering arrays
• Optimal linear perfect hash families
• Perfect Hash Families: Constructions and Existence
• Perfect hash families, identifiable parent property codes and covering arrays.
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect hashing
• Recursive constructions of secure codes and hash families using difference function families.
• Roux-type constructions for covering arrays of strengths three and four
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• The CRC handbook of combinatorial designs

Cited in

(21)

• Fractal perfect hash families (extended abstract)
• Perfect hash families from transversal designs
• Improved bounds for separating hash families
• On the relationships between perfect nonlinear functions and universal hash families
• Separating hash families: a Johnson-type bound and new constructions
• A hierarchical framework for recovery in compressive sensing
• A recursive construction for perfect hash families
• Perfect Hash Families: Constructions and Existence
• Constructing heterogeneous hash families by puncturing linear transversal designs
• Balanced Families of Perfect Hash Functions and Their Applications
• Linear Time Constructions of Some $$d$$-Restriction Problems
• Linear hash families and forbidden configurations
• Bounds for separating hash families
• A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
• Improving two recursive constructions for covering arrays
• Constructing Perfect Hash Families Using a Greedy Algorithm
• Perfect hash families of strength three with three rows from varieties on finite projective geometries
• Distributing hash families with few rows
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect hash families: the generalization to higher indices
• Explicit constructions of perfect hash families from algebraic curves over finite fields

This page was built for publication: Explicit constructions for perfect hash families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1008968)