299 citations · 637 across the 31 of their papers we have counts for
36 papers
Sharp Bounds for Mutual Covering
Jingbo Liu, Mohammad H. Yassaee, Sergio Verdú
A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of inde…
Second-Order Converses via Reverse Hypercontractivity
Jingbo Liu, Ramon van Handel, Sergio Verdú
A strong converse shows that no procedure can beat the asymptotic (as blocklength ) fundamental limit of a given information-theoretic problem for any fixed error proba…
Chaining Mutual Information and Tightening Generalization Bounds
Amir R. Asadi, Emmanuel Abbe, Sergio Verdú
Bounding the generalization error of learning algorithms has a long history, which yet falls short in explaining various generalization successes including those of deep learning.…
The Error Probability of Generalized Perfect Codes via the Meta-Converse
Gonzalo Vazquez-Vilar, Albert Guillén i Fàbregas, Sergio Verdú
We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions o…
Improved Bounds on Lossless Source Coding and Guessing Moments via Rényi Measures
Igal Sason, Sergio Verdú
This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments…
Optimal Universal Lossless Compression with Side Information
Yeohee Im, Sergio Verdú
This paper presents conditional versions of Lempel-Ziv (LZ) algorithm for settings where compressor and decompressor have access to the same side information. We propose a fixed-le…