A Unified Random Coding Bound
From MaRDI portal
Cited in
(4)- Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- A strong version of the redundancy-capacity theorem of universal coding
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities
- Channel simulation: theory and applications to lossy compression and differential privacy
This page was built for publication: A Unified Random Coding Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682952)