Constructing Perfect Hash Families Using a Greedy Algorithm

DOI10.1142/9789812832245_0008MaRDI QIDQ3614599zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn

Publication date 9 March 2009

Published in Coding and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/9789812832245_0008

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

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

Cited in

(8)

• Perfect hash families: Probabilistic methods and explicit constructions
• Strengthening hash families and compressive sensing
• Distributing hash families with few rows
• Construct a perfect word hash function in time independent of the size of integers
• Balanced families of perfect hash functions and their applications
• A recursive construction for perfect hash families
• Randomized Post-optimization for t-Restrictions
• Perfect Hash Families: Constructions and Existence

This page was built for publication: Constructing Perfect Hash Families Using a Greedy Algorithm

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