Beating the probabilistic lower bound on \(q\)-perfect hashing

DOI10.1007/s00493-023-00014-xarXiv1908.08792MaRDI QIDQ6081370

Xing, Chaoping, Chen Yuan

Publication date: 4 October 2023

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.08792

zbMATH Keywords

perfect hash familylist recoveryperfect hash code

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (1)

Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings

This page was built for publication: Beating the probabilistic lower bound on \(q\)-perfect hashing