Second-Order Converses via Reverse Hypercontractivity

15 Nov 2019 Liu Jingbo van Handel Ramon Verdú Sergio

A strong converse shows that no procedure can beat the asymptotic (as blocklength $n\to\infty$) fundamental limit of a given information-theoretic problem for any fixed error probability. A second-order converse strengthens this conclusion by showing that the asymptotic fundamental limit cannot be exceeded by more than $O(\tfrac{1}{\sqrt{n}})$... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY