Zobrazeno 1 - 10
of 365
pro vyhledávání: '"Sergio Verdu"'
Publikováno v:
IEEE Transactions on Information Theory. 66:704-721
The Brascamp-Lieb inequality in functional analysis can be viewed as a measure of the “uncorrelatedness” of a joint probability distribution. We define the smooth Brascamp-Lieb (BL) divergence as the infimum of the best constant in the Brascamp-L
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17f3fa2a24feb8a79ca1f8365f632a48
https://doi.org/10.1109/tit.2019.2953151
https://doi.org/10.1109/tit.2019.2953151
Autor:
Sergio Verdu
Publikováno v:
Entropy, Vol 23, Iss 199, p 199 (2021)
Entropy
Volume 23
Issue 2
Entropy
Volume 23
Issue 2
Over the last six decades, the representation of error exponent functions for data transmission through noisy channels at rates below capacity has seen three distinct approaches: (1) Through Gallager’s E0 functions (with and without cost constraint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d78f2f7861a568f93072e1a311d598ee
https://www.mdpi.com/1099-4300/23/2/199
https://www.mdpi.com/1099-4300/23/2/199
Autor:
Igal Sason, Sergio Verdu
Publikováno v:
IEEE Transactions on Information Theory. 64:4323-4346
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 quantify the number of guesses required for correctly identifying the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::296896266d1c2889f9b2f0aa81ff3e2b
https://doi.org/10.1109/tit.2018.2803162
https://doi.org/10.1109/tit.2018.2803162
Autor:
Sergio Verdu, Yanina Y. Shkel
Publikováno v:
ISIT
This paper considers the problem of lossy source coding with a specific distortion measure: logarithmic loss. The focus of this paper is on the single-shot approach, which exposes crisply the connection between lossless source coding with list decodi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c140e12d4d7c4f378b89f29ea3a12b6
https://doi.org/10.1109/tit.2017.2700860
https://doi.org/10.1109/tit.2017.2700860
Autor:
Igal Sason, Sergio Verdu
Publikováno v:
IEEE Transactions on Information Theory. 64:4-25
This paper gives upper and lower bounds on the minimum error probability of Bayesian $M$ -ary hypothesis testing in terms of the Arimoto–Renyi conditional entropy of an arbitrary order $\alpha $ . The improved tightness of these bounds over their s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4095158c32c60dbf75126eae97c4819b
https://doi.org/10.1109/tit.2017.2757496
https://doi.org/10.1109/tit.2017.2757496
Autor:
Sergio Verdu, Changxiao Cai
Publikováno v:
Entropy
Volume 21
Issue 10
Entropy, Vol 21, Iss 10, p 969 (2019)
Volume 21
Issue 10
Entropy, Vol 21, Iss 10, p 969 (2019)
Ré
nyi-type generalizations of entropy, relative entropy and mutual information have found numerous applications throughout information theory and beyond. While there is consensus that the ways A. Ré
nyi generalized entropy and
nyi-type generalizations of entropy, relative entropy and mutual information have found numerous applications throughout information theory and beyond. While there is consensus that the ways A. Ré
nyi generalized entropy and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::623a433006ce7def86e6a4ab79ed6de3
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 independently generated candidates, falling within a given set. We use a w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0f5cc7def08e2d30d5bf27b00a98d6a
Publikováno v:
e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
instname
IEEE Transactions on Information Theory
instname
IEEE Transactions on Information Theory
We introduce a definition of perfect and quasi-perfect codes for symmetric channels parametrized by an auxiliary output distribution. This notion generalizes previous definitions of perfect and quasi-perfect codes and encompasses maximum distance sep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::543920786f00dbe9557973f1ec09b274
https://doi.org/10.1109/TIT.2019.2906227
https://doi.org/10.1109/TIT.2019.2906227
Autor:
Victoria Kostina, Sergio Verdu
Publikováno v:
ITW
This paper shows new general nonasymptotic achievability and converse bounds and performs their dispersion analysis for the lossy compression problem in which the compressor observes the source through a noisy channel. While this problem is asymptoti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::80cb9df2870a9d835aa2963b4ae67328
https://doi.org/10.1109/tit.2016.2562008
https://doi.org/10.1109/tit.2016.2562008
Autor:
Igal Sason, Sergio Verdu
Publikováno v:
IEEE Transactions on Information Theory. 62:5973-6006
This paper develops systematic approaches to obtain $f$-divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets. Functional domination is one such approach, where special emphasis is placed on finding the be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::65a6ea51b7c2d41a64296ec2e9ef2581
https://doi.org/10.1109/tit.2016.2603151
https://doi.org/10.1109/tit.2016.2603151