Fractal Perfect Hash Families (Extended Abstract)

Charles Colbourn; Ryan E. Dougherty

doi:10.1016/j.endm.2018.02.018

Fractal Perfect Hash Families (Extended Abstract)

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	37-42
Number of pages	6
Journal	Electronic Notes in Discrete Mathematics
Volume	65
DOIs	https://doi.org/10.1016/j.endm.2018.02.018
State	Published - Mar 2018

Keywords

covering design
fractal perfect hash family
perfect hash family

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/j.endm.2018.02.018

Cite this

@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.}",

note = "Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = mar,

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

Y1 - 2018/3

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

AN - SCOPUS:85044007737

SN - 1571-0653

VL - 65

SP - 37

EP - 42

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

ER -

Fractal Perfect Hash Families (Extended Abstract)

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this