Fractal Perfect Hash Families (Extended Abstract)

Charles Colbourn, Ryan E. Dougherty

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)37-42
Number of pages6
JournalElectronic Notes in Discrete Mathematics
Volume65
DOIs
StatePublished - Mar 1 2018

Fingerprint

Perfect Hash Family
Fractals
Fractal
Covering

Keywords

  • covering design
  • fractal perfect hash family
  • perfect hash family

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Fractal Perfect Hash Families (Extended Abstract). / Colbourn, Charles; Dougherty, Ryan E.

In: Electronic Notes in Discrete Mathematics, Vol. 65, 01.03.2018, p. 37-42.

Research output: Contribution to journalArticle

@article{4ad626ff2be746f38235da6a82bf8536,
title = "Fractal Perfect Hash Families (Extended Abstract)",
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.",
keywords = "covering design, fractal perfect hash family, perfect hash family",
author = "Charles Colbourn and Dougherty, {Ryan E.}",
year = "2018",
month = "3",
day = "1",
doi = "10.1016/j.endm.2018.02.018",
language = "English (US)",
volume = "65",
pages = "37--42",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",

}

TY - JOUR

T1 - Fractal Perfect Hash Families (Extended Abstract)

AU - Colbourn, Charles

AU - Dougherty, Ryan E.

PY - 2018/3/1

Y1 - 2018/3/1

N2 - 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.

AB - 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.

KW - covering design

KW - fractal perfect hash family

KW - perfect hash family

UR - http://www.scopus.com/inward/record.url?scp=85044007737&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85044007737&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2018.02.018

DO - 10.1016/j.endm.2018.02.018

M3 - Article

VL - 65

SP - 37

EP - 42

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

ER -