New bounds for perfect \(k\)-hashing
From MaRDI portal
Publication:2217492
DOI10.1016/j.dam.2020.11.001zbMath1460.94043arXiv2002.11025OpenAlexW3099842202MaRDI QIDQ2217492
Publication date: 29 December 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.11025
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds for perfect hashing via information theory
- A gap in the slice rank of \(k\)-tensors
- 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
- Beating Fredman-Komlós for Perfect k-Hashing.
- An Improved Bound on the Zero-Error List-Decoding Capacity of the 4/3 Channel
- Hide and Seek, Data Storage, and Entropy
- An entropy proof of Bregman's theorem
This page was built for publication: New bounds for perfect \(k\)-hashing