New bounds for perfect hashing via information theory

From MaRDI portal
Revision as of 02:57, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1122979

DOI10.1016/S0195-6698(88)80048-9zbMath0676.68007OpenAlexW2056884477MaRDI QIDQ1122979

S. H. Smith

Publication date: 1988

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80048-9




Related Items (30)

Separating Hash Families: A Johnson-type bound and New ConstructionsOn the extremal combinatorics of the Hamming spaceOn colorful edge triples in edge-colored complete graphsSeparation and WitnessesLinear Time Constructions of Some $$d$$-Restriction ProblemsPerfect Hashing and ProbabilityGeneralizing Körner's graph entropy to graphonsApproximation of functions of few variables in high dimensionsEntropy of symmetric graphsImproved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree PackingsComplexity of approximation of functions of few variables in high dimensionsGeneralized hashing and parent-identifying codes.New bounds for perfect \(k\)-hashingMaximum IPP codes of length 3Some intriguing upper bounds for separating hash familiesSymmetric graphs with respect to graph entropyRecursive bounds for perfect hashingCross‐intersecting couples of graphsA better bound for locally thin set familiesA generalization of the Bollobás set pairs inequalityUnnamed ItemExplicit constructions for perfect hash familiesOn the Circuit Complexity of Perfect HashingOn codes with the identifiable parent propertyOptimal linear perfect hash familiesBeating Fredman-Komlós for Perfect k-Hashing.Beating Fredman-Komlós for perfect \(k\)-hashingPerfect hash families: Probabilistic methods and explicit constructionsAnti-Ramsey colorings in several roundsEntropy splitting for antiblocking corners and perfect graphs



Cites Work




This page was built for publication: New bounds for perfect hashing via information theory