Distributing hash families with few rows

Charles J. Colbourn, Ryan E. Dougherty, Daniel Horsley

Research output: Contribution to journalArticle

Abstract

Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend it in three ways. First, the method is generalized from homogeneous hash families (in which every row has the same number of symbols) to heterogeneous ones. Second, the extension treats distributing hash families, in which only separation into a prescribed number of parts is required, rather than perfect hash families, in which columns must be completely separated. Third, the requirements on one of the main ingredients are relaxed to permit the use of a large class of distributing hash families, which we call fractal. Constructions for fractal perfect and distributing hash families are given, and applications to the construction of perfect hash families of large strength are developed.

Original languageEnglish (US)
Pages (from-to)31-41
Number of pages11
JournalTheoretical Computer Science
Volume800
DOIs
StatePublished - Dec 31 2019

Fingerprint

Fractals
Perfect Hash Family
Fractal
Covering Array
Replacement
Family
Requirements

Keywords

  • Covering
  • Distributing hash family
  • Fractal hash family
  • Perfect hash family

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Distributing hash families with few rows. / Colbourn, Charles J.; Dougherty, Ryan E.; Horsley, Daniel.

In: Theoretical Computer Science, Vol. 800, 31.12.2019, p. 31-41.

Research output: Contribution to journalArticle

Colbourn, Charles J. ; Dougherty, Ryan E. ; Horsley, Daniel. / Distributing hash families with few rows. In: Theoretical Computer Science. 2019 ; Vol. 800. pp. 31-41.
@article{8a029c3fde1243b2b2260d7ae5aa6cd2,
title = "Distributing hash families with few rows",
abstract = "Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend it in three ways. First, the method is generalized from homogeneous hash families (in which every row has the same number of symbols) to heterogeneous ones. Second, the extension treats distributing hash families, in which only separation into a prescribed number of parts is required, rather than perfect hash families, in which columns must be completely separated. Third, the requirements on one of the main ingredients are relaxed to permit the use of a large class of distributing hash families, which we call fractal. Constructions for fractal perfect and distributing hash families are given, and applications to the construction of perfect hash families of large strength are developed.",
keywords = "Covering, Distributing hash family, Fractal hash family, Perfect hash family",
author = "Colbourn, {Charles J.} and Dougherty, {Ryan E.} and Daniel Horsley",
year = "2019",
month = "12",
day = "31",
doi = "10.1016/j.tcs.2019.10.014",
language = "English (US)",
volume = "800",
pages = "31--41",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",

}

TY - JOUR

T1 - Distributing hash families with few rows

AU - Colbourn, Charles J.

AU - Dougherty, Ryan E.

AU - Horsley, Daniel

PY - 2019/12/31

Y1 - 2019/12/31

N2 - Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend it in three ways. First, the method is generalized from homogeneous hash families (in which every row has the same number of symbols) to heterogeneous ones. Second, the extension treats distributing hash families, in which only separation into a prescribed number of parts is required, rather than perfect hash families, in which columns must be completely separated. Third, the requirements on one of the main ingredients are relaxed to permit the use of a large class of distributing hash families, which we call fractal. Constructions for fractal perfect and distributing hash families are given, and applications to the construction of perfect hash families of large strength are developed.

AB - Column replacement techniques for creating covering arrays rely on the construction of perfect and distributing hash families with few rows, having as many columns as possible for a specified number of symbols. To construct distributing hash families in which the number of rows is less than the strength, we examine a method due to Blackburn and extend it in three ways. First, the method is generalized from homogeneous hash families (in which every row has the same number of symbols) to heterogeneous ones. Second, the extension treats distributing hash families, in which only separation into a prescribed number of parts is required, rather than perfect hash families, in which columns must be completely separated. Third, the requirements on one of the main ingredients are relaxed to permit the use of a large class of distributing hash families, which we call fractal. Constructions for fractal perfect and distributing hash families are given, and applications to the construction of perfect hash families of large strength are developed.

KW - Covering

KW - Distributing hash family

KW - Fractal hash family

KW - Perfect hash family

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

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

U2 - 10.1016/j.tcs.2019.10.014

DO - 10.1016/j.tcs.2019.10.014

M3 - Article

AN - SCOPUS:85074470045

VL - 800

SP - 31

EP - 41

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -