Perfect Hash Families: Constructions and Existence

DOI10.1515/JMC.2007.008zbMath1128.05012OpenAlexW1993414155MaRDI QIDQ5295346

Charles J. Colbourn, Robert A. II Walker

Publication date: 27 July 2007

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/jmc.2007.008

zbMATH Keywords

perfect hash familyinteraction testingthree-term arithmetic progression

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (20)

Separating Hash Families: A Johnson-type bound and New Constructions ⋮ Improved bounds for separating hash families ⋮ Perfect hash families of strength three with three rows from varieties on finite projective geometries ⋮ Detecting arrays for effects of single factors ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ A hierarchical framework for recovery in compressive sensing ⋮ Locating and detecting arrays for interaction faults ⋮ Bounds for separating hash families ⋮ Some intriguing upper bounds for separating hash families ⋮ A note on Ramsey numbers for Berge-\(G\) hypergraphs ⋮ Fractal perfect hash families (extended abstract) ⋮ A recursive construction for perfect hash families ⋮ Tabu search for covering arrays using permutation vectors ⋮ Randomized Post-optimization for t-Restrictions ⋮ Constructions and bounds for separating hash families ⋮ Explicit constructions for perfect hash families ⋮ Linear hash families and forbidden configurations ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ Improving two recursive constructions for covering arrays ⋮ Distributing hash families with few rows

Cites Work

• Unnamed Item
• Unnamed Item
• Roux-type constructions for covering arrays of strengths three and four
• Explicit construction of exponential sized families of k-independent sets
• Subset sums
• Perfect hashing
• Progression-free sets in finite abelian groups.
• On a class of traceability codes
• 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 the lower estimation of non-averaging sets
• On subsets of finite Abelian groups with no 3-term arithmetic progressions
• On triples in arithmetic progression
• Recursive constructions of secure codes and hash families using difference function families.
• Integer sets containing no arithmetic progressions
• Efficient Multiplicative Sharing Schemes
• Solving the MOLR and Social Golfers Problems
• On Non-Averaging Sets of Integers
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• A new proof of Szemerédi's theorem

This page was built for publication: Perfect Hash Families: Constructions and Existence