Improving the Trifference Lower Bound via Non-Perfect Hashing
cs.IT, math.IT
Submitted: 2026-11-08
Updated: 2026-11-12
Terminology
Sources
- Bounds and Limitations on Codes Achieving List Recovery Capacity
- Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$-Uniform Hypergraphs
- The probabilistic bound for perfect hashing is sharp only for binary alphabets
- Separating hash families with large universe II
- Beating the probabilistic lower bound on $q$-perfect hashing
Related papers
- The Gaussian Multiuser Channel Capacity Region
- The mathematical landscape of partial information decomposition: A comprehensive review of properties and measures
- Electromagnetic Signal and Information Theory: A Continuous-Aperture Array Perspective
- Analytically Characterized Optimal Power Control for Signal-Level-Integrated Sensing, Computing and Communication in Federated Learning
- Information Spectrum Methods for Multiple-Access Channels--Part I: epsilon-Capacity Regions in the Mixed Gaussian Case
- Seed Recycling: Explicit Codes for Mixed Synchronization Errors Matching the Leading Term of the Gilbert--Varshamov Bound