Optimal linear perfect hash families
type: Item
instance of: scholarly article
title: Optimal linear perfect hash families
zbMATH Open document ID: 0914.68088
author: Simon R. Blackburn
author: Peter R. Wild
published in: Journal of Combinatorial Theory. Series A
publication date: 1998-10-18T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1212980
zbMATH Keywords: perfect has families
MaRDI profile type: Publication
OpenAlex ID: W1987789009
cites work: Explicit construction of exponential sized families of k-independent sets
cites work: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions
cites work: Q4221879
cites work: Efficient Multiplicative Sharing Schemes
cites work: On the Size of Separating Systems and Families of Perfect Hash Functions
cites work: Q3851217
cites work: Q5184922
cites work: Fredman–Komlós bounds and information theory
cites work: New bounds for perfect hashing via information theory
cites work: Q3219752
cites work: Lower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
cites work: Automorphisms of unitary block designs
cites work: Improved bounds for covering complete uniform hypergraphs
DOI: 10.1006/JCTA.1998.2876
description: scientific article; zbMATH DE number 1212980