research
∙
01/01/2019
Sharp Bounds for Mutual Covering
Verdú reformulated the covering problem in the non-asymptotic informatio...
share
research
∙
12/25/2018
Second-Order Converses via Reverse Hypercontractivity
A strong converse shows that no procedure can beat the asymptotic (as bl...
research
∙
06/11/2018
Chaining Mutual Information and Tightening Generalization Bounds
Bounding the generalization error of learning algorithms has a long hist...
research
∙
05/25/2018
The Error Probability of Generalized Perfect Codes via the Meta-Converse
We introduce a definition of perfect and quasi-perfect codes for symmetr...
research
∙
01/04/2018
