Abstract
Constructions of perfect hash families (PHFs) are developed in which the number of rows is less than the strength, using a method due to Blackburn. The constructions use coverings of strength d along with a restricted class of perfect hash families, called fractal PHFs. Constructions for fractal PHFs are given, and applications to the construction of PHFs of large strengths are developed.
Author supplied keywords
Cite
CITATION STYLE
APA
Colbourn, C. J., & Dougherty, R. E. (2018). Fractal Perfect Hash Families (Extended Abstract). Electronic Notes in Discrete Mathematics, 65, 37–42. https://doi.org/10.1016/j.endm.2018.02.018
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free