Perfect Hash Families: The Generalization to Higher Indices

Ryan E. Dougherty, Charles J. Colbourn

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Perfect hash families are often represented as combinatorial arrays encoding partitions of k items into v classes, so that every t or fewer of the items are completely separated by at least a specified number of chosen partitions. This specified number is the index of the hash family. The case when each t-set must be separated at least once has been extensively researched; they arise in diverse applications, both directly and as fundamental ingredients in a column replacement strategy for a variety of combinatorial arrays. In this paper, construction techniques and algorithmic methods for constructing perfect hash families are surveyed, in order to explore extensions to the situation when each t-set must be separated by more than one partition.

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer
Pages177-197
Number of pages21
DOIs
StatePublished - 2020
Externally publishedYes

Publication series

NameSpringer Optimization and Its Applications
Volume165
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'Perfect Hash Families: The Generalization to Higher Indices'. Together they form a unique fingerprint.

Cite this