A recursive construction for perfect hash families

DOI10.1515/JMC.2009.018zbMATH Open1190.05029OpenAlexW2040067189MaRDI QIDQ3558748FDOQ3558748

Authors: Charles J. Colbourn, Alan C. H. Ling 

Publication date: 6 May 2010

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

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

Recommendations

• Perfect hash families: Probabilistic methods and explicit constructions
• Fractal perfect hash families (extended abstract)
• scientific article; zbMATH DE number 1228785
• Perfect Hash Families: Constructions and Existence
• Constructing Perfect Hash Families Using a Greedy Algorithm

zbMATH Keywords

orthogonal arrayperfect hash familydistributing hash family

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Cites Work

• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Explicit constructions for perfect hash families
• Optimal linear perfect hash families
• Title not available (Why is that?)
• Perfect Hash Families: Constructions and Existence
• Linear hash families and forbidden configurations

Cited In (6)

• Constructing heterogeneous hash families by puncturing linear transversal designs
• Distributing hash families with few rows
• Fractal perfect hash families (extended abstract)
• Improving two recursive constructions for covering arrays
• Perfect hash families: Probabilistic methods and explicit constructions
• Perfect Hash Families: Constructions and Existence

This page was built for publication: A recursive construction for perfect hash families

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