New bounds for perfect hashing via information theory
From MaRDI portal
(Redirected from Publication:1122979)
Recommendations
Cites work
- scientific article; zbMATH DE number 3468645 (Why is no real title available?)
- scientific article; zbMATH DE number 3586931 (Why is no real title available?)
- Fredman–Komlós bounds and information theory
- Lexicographic codes: Error-correcting codes from game theory
- On the Size of Separating Systems and Families of Perfect Hash Functions
Cited in
(33)- Optimal linear perfect hash families
- Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings
- Beating Fredman-Komlós for Perfect k-Hashing.
- Approximation of functions of few variables in high dimensions
- scientific article; zbMATH DE number 7204408 (Why is no real title available?)
- On the extremal combinatorics of the Hamming space
- On the Circuit Complexity of Perfect Hashing
- Generalized hashing and parent-identifying codes.
- On colorful edge triples in edge-colored complete graphs
- A better bound for locally thin set families
- Some intriguing upper bounds for separating hash families
- New bounds for perfect \(k\)-hashing
- Separating hash families: a Johnson-type bound and new constructions
- On codes with the identifiable parent property
- Generalizing Körner's graph entropy to graphons
- Beating the probabilistic lower bound on \(q\)-perfect hashing
- Perfect hash families: Probabilistic methods and explicit constructions
- Recursive bounds for perfect hashing
- Separation and Witnesses
- Cross‐intersecting couples of graphs
- Anti-Ramsey colorings in several rounds
- Beating Fredman-Komlós for perfect \(k\)-hashing
- Entropy splitting for antiblocking corners and perfect graphs
- Interactive Hashing: An Information Theoretic Tool (Invited Talk)
- Maximum IPP codes of length 3
- Symmetric graphs with respect to graph entropy
- A generalization of the Bollobás set pairs inequality
- Complexity of approximation of functions of few variables in high dimensions
- Linear Time Constructions of Some $$d$$-Restriction Problems
- Perfect Hashing and Probability
- scientific article; zbMATH DE number 6351507 (Why is no real title available?)
- Entropy of symmetric graphs
- Explicit constructions for perfect hash families
This page was built for publication: New bounds for perfect hashing via information theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122979)
