New bounds for perfect hashing via information theory
From MaRDI portal
Publication:1122979
DOI10.1016/S0195-6698(88)80048-9zbMath0676.68007OpenAlexW2056884477MaRDI QIDQ1122979
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
Separating Hash Families: A Johnson-type bound and New Constructions, On the extremal combinatorics of the Hamming space, On colorful edge triples in edge-colored complete graphs, Separation and Witnesses, Linear Time Constructions of Some $$d$$-Restriction Problems, Perfect Hashing and Probability, Generalizing Körner's graph entropy to graphons, Approximation of functions of few variables in high dimensions, Entropy of symmetric graphs, Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings, Complexity of approximation of functions of few variables in high dimensions, Generalized hashing and parent-identifying codes., New bounds for perfect \(k\)-hashing, Maximum IPP codes of length 3, Some intriguing upper bounds for separating hash families, Symmetric graphs with respect to graph entropy, Recursive bounds for perfect hashing, Cross‐intersecting couples of graphs, A better bound for locally thin set families, A generalization of the Bollobás set pairs inequality, Unnamed Item, Explicit constructions for perfect hash families, On the Circuit Complexity of Perfect Hashing, On codes with the identifiable parent property, Optimal linear perfect hash families, Beating Fredman-Komlós for Perfect k-Hashing., Beating Fredman-Komlós for perfect \(k\)-hashing, Perfect hash families: Probabilistic methods and explicit constructions, Anti-Ramsey colorings in several rounds, Entropy splitting for antiblocking corners and perfect graphs
Cites Work
