Beating Fredman-Komlós for Perfect k-Hashing.

DOI10.4230/LIPIcs.ICALP.2019.92OpenAlexW2963821790MaRDI QIDQ5091253

Andrii Riazanov, Venkatesan Guruswami

Publication date: 21 July 2022

Full work available at URL: http://arxiv.org/pdf/1805.04151.pdf

zbMATH Keywords

graph entropycoding theoryhash familyperfect hashingzero-error information theory

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (2)

New bounds for perfect \(k\)-hashing ⋮ A generalization of the Bollobás set pairs inequality

Cites Work

• Unnamed Item
• Unnamed Item
• New bounds for perfect hashing via information theory
• On the Size of Separating Systems and Families of Perfect Hash Functions
• Fredman–Komlós bounds and information theory
• Zero error capacity under list decoding
• Perfect Hashing and Probability
• An upper bound on the zero-error list-coding capacity

This page was built for publication: Beating Fredman-Komlós for Perfect k-Hashing.