Perfect Hash Families: Constructions and Existence
From MaRDI portal
Recommendations
- Explicit constructions for perfect hash families
- Perfect hash families: Probabilistic methods and explicit constructions
- scientific article; zbMATH DE number 1228785
- A recursive construction for perfect hash families
- Structures of a type of perfect hash function family
- Perfect hash families: the generalization to higher indices
- A new lower bound on perfect hash families
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Constructing Perfect Hash Families Using a Greedy Algorithm
- scientific article; zbMATH DE number 1462939
Cites work
- A new proof of Szemerédi's theorem
- Efficient Multiplicative Sharing Schemes
- Explicit construction of exponential sized families of k-independent sets
- scientific article; zbMATH DE number 1228785 (Why is no real title available?)
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- Integer sets containing no arithmetic progressions
- New constructions for IPP codes
- On a class of traceability codes
- On Certain Sets of Integers
- On Non-Averaging Sets of Integers
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- On subsets of finite Abelian groups with no 3-term arithmetic progressions
- On the lower estimation of non-averaging sets
- On triples in arithmetic progression
- Perfect hash families: Probabilistic methods and explicit constructions
- Perfect hashing
- Progression-free sets in finite abelian groups.
- 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
- Solving the MOLR and Social Golfers Problems
- Subset sums
Cited in
(39)- Explicit constructions for perfect hash families
- Linear hash families and forbidden configurations
- Perfect hash families: Probabilistic methods and explicit constructions
- A hierarchical framework for recovery in compressive sensing
- Some intriguing upper bounds for separating hash families
- A note on Ramsey numbers for Berge-\(G\) hypergraphs
- Fractal perfect hash families (extended abstract)
- An algebraic approach to Cichelli's perfect hashing
- Perfect hash families: the generalization to higher indices
- Arrays for combinatorial interaction testing: a review on constructive approaches
- Improving two recursive constructions for covering arrays
- Distributing hash families with few rows
- Locating and detecting arrays for interaction faults
- In search of mathematical primitives for deriving universal projective hash families
- Bounds for separating hash families
- Geometric constructions of optimal linear perfect hash families
- Structures of a type of perfect hash function family
- Constructions of 2-cover-free families and related separating hash families
- A recursive construction for perfect hash families
- Perfect hash families, identifiable parent property codes and covering arrays.
- A new lower bound on perfect hash families
- Constructing Perfect Hash Families Using a Greedy Algorithm
- Improved bounds for separating hash families
- On the relationships between perfect nonlinear functions and universal hash families
- Constructing heterogeneous hash families by puncturing linear transversal designs
- scientific article; zbMATH DE number 1228785 (Why is no real title available?)
- scientific article; zbMATH DE number 1462939 (Why is no real title available?)
- Randomized Post-optimization for t-Restrictions
- scientific article; zbMATH DE number 1439481 (Why is no real title available?)
- Perfect hash families from transversal designs
- Separating hash families: a Johnson-type bound and new constructions
- Balanced Families of Perfect Hash Functions and Their Applications
- Explicit constructions of perfect hash families from algebraic curves over finite fields
- Detecting arrays for effects of single factors
- Separating hash families with large universe
- Constructions and bounds for separating hash families
- A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
- Perfect hash families of strength three with three rows from varieties on finite projective geometries
- Tabu search for covering arrays using permutation vectors
This page was built for publication: Perfect Hash Families: Constructions and Existence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5295346)
