Explicit constructions for perfect hash families

DOI10.1007/S10623-007-9138-6zbMATH Open1185.05020OpenAlexW1989558192MaRDI QIDQ1008968FDOQ1008968

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

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

zbMATH Keywords

perfect hash familyrecursive constructionPFH

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Cites Work

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

Cited In (21)

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

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)