Linear hash families and forbidden configurations

Charles Colbourn, Alan C H Ling

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The classical orthogonal arrays over the finite field underlie a powerful construction of perfect hash families. By forbidding certain sets of configurations from arising in these orthogonal arrays, this construction yields previously unknown perfect, separating, and distributing hash families. When the strength s of the orthogonal array, the strength t of the hash family, and the number of its rows are all specified, the forbidden sets of configurations can be determined explicitly. Each forbidden set leads to a set of equations that must simultaneously hold. Hence computational techniques can be used to determine sufficient conditions for a perfect, separating, and distributing hash family to exist. In this paper the forbidden configurations, resulting equations, and existence results are determined when (s, t) {(2, 5), (2, 6), (3, 4), (4, 3)}. Applications to the existence of covering arrays of strength at most six are presented.

Original languageEnglish (US)
Pages (from-to)25-55
Number of pages31
JournalDesigns, Codes, and Cryptography
Volume52
Issue number1
DOIs
StatePublished - Jul 2009

Fingerprint

Orthogonal Array
Configuration
Perfect Hash Family
Covering Array
Computational Techniques
Existence Results
Galois field
Unknown
Family
Sufficient Conditions

Keywords

  • Covering array
  • Finite field
  • Orthogonal array
  • Perfect hash family
  • Separating hash family

ASJC Scopus subject areas

  • Applied Mathematics
  • Computer Science Applications

Cite this

Linear hash families and forbidden configurations. / Colbourn, Charles; Ling, Alan C H.

In: Designs, Codes, and Cryptography, Vol. 52, No. 1, 07.2009, p. 25-55.

Research output: Contribution to journalArticle

@article{ff8e9f141ea249b88e7e8218275dd47f,
title = "Linear hash families and forbidden configurations",
abstract = "The classical orthogonal arrays over the finite field underlie a powerful construction of perfect hash families. By forbidding certain sets of configurations from arising in these orthogonal arrays, this construction yields previously unknown perfect, separating, and distributing hash families. When the strength s of the orthogonal array, the strength t of the hash family, and the number of its rows are all specified, the forbidden sets of configurations can be determined explicitly. Each forbidden set leads to a set of equations that must simultaneously hold. Hence computational techniques can be used to determine sufficient conditions for a perfect, separating, and distributing hash family to exist. In this paper the forbidden configurations, resulting equations, and existence results are determined when (s, t) {(2, 5), (2, 6), (3, 4), (4, 3)}. Applications to the existence of covering arrays of strength at most six are presented.",
keywords = "Covering array, Finite field, Orthogonal array, Perfect hash family, Separating hash family",
author = "Charles Colbourn and Ling, {Alan C H}",
year = "2009",
month = "7",
doi = "10.1007/s10623-008-9266-7",
language = "English (US)",
volume = "52",
pages = "25--55",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
publisher = "Springer Netherlands",
number = "1",

}

TY - JOUR

T1 - Linear hash families and forbidden configurations

AU - Colbourn, Charles

AU - Ling, Alan C H

PY - 2009/7

Y1 - 2009/7

N2 - The classical orthogonal arrays over the finite field underlie a powerful construction of perfect hash families. By forbidding certain sets of configurations from arising in these orthogonal arrays, this construction yields previously unknown perfect, separating, and distributing hash families. When the strength s of the orthogonal array, the strength t of the hash family, and the number of its rows are all specified, the forbidden sets of configurations can be determined explicitly. Each forbidden set leads to a set of equations that must simultaneously hold. Hence computational techniques can be used to determine sufficient conditions for a perfect, separating, and distributing hash family to exist. In this paper the forbidden configurations, resulting equations, and existence results are determined when (s, t) {(2, 5), (2, 6), (3, 4), (4, 3)}. Applications to the existence of covering arrays of strength at most six are presented.

AB - The classical orthogonal arrays over the finite field underlie a powerful construction of perfect hash families. By forbidding certain sets of configurations from arising in these orthogonal arrays, this construction yields previously unknown perfect, separating, and distributing hash families. When the strength s of the orthogonal array, the strength t of the hash family, and the number of its rows are all specified, the forbidden sets of configurations can be determined explicitly. Each forbidden set leads to a set of equations that must simultaneously hold. Hence computational techniques can be used to determine sufficient conditions for a perfect, separating, and distributing hash family to exist. In this paper the forbidden configurations, resulting equations, and existence results are determined when (s, t) {(2, 5), (2, 6), (3, 4), (4, 3)}. Applications to the existence of covering arrays of strength at most six are presented.

KW - Covering array

KW - Finite field

KW - Orthogonal array

KW - Perfect hash family

KW - Separating hash family

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

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

U2 - 10.1007/s10623-008-9266-7

DO - 10.1007/s10623-008-9266-7

M3 - Article

AN - SCOPUS:67349117311

VL - 52

SP - 25

EP - 55

JO - Designs, Codes, and Cryptography

JF - Designs, Codes, and Cryptography

SN - 0925-1022

IS - 1

ER -