The Entropic Doubling Constant and Robustness of Gaussian Codebooks for Additive-Noise Channels

Entropy comparison inequalities are obtained for the differential entropy <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$h(X+Y)$ </tex-math></inline-formula> of the sum of two independent random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, when one is replaced by a Gaussian. For identically distributed random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, these are closely related to bounds on the entropic doubling constant, which quantifies the entropy increase when adding an independent copy of a random vector to itself. Consequences of both large and small doubling are explored. For the former, lower bounds are deduced on the entropy increase when adding an independent Gaussian, while for the latter, a qualitative stability result for the entropy power inequality is obtained. In the more general case of non-identically distributed random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, a Gaussian comparison inequality with interesting implications for channel coding is established: For additive-noise channels with a power constraint, Gaussian codebooks come within a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\frac {\mathsf { snr}}{3{\mathsf { snr}}+2}$ </tex-math></inline-formula> factor of capacity. In the low-SNR regime this improves the half-a-bit additive bound of Zamir and Erez. Analogous results are obtained for additive-noise multiple access channels, and for linear, additive-noise

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Information Theory
Published
2024-09-16
DOI
https://doi.org/10.1109/tit.2024.3460472
Citations
1
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
0.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Entropic Doubling Constant and Robustness of Gaussian Codebooks for Additive-Noise Channels

Ioannis Kontoyiannis, Lampros Gavalakis, Mokshay Madiman
1 citations
IEEE Transactions on Information Theory
Advanced Data Compression Techniques
0.25
article

The Entropic Doubling Constant and Robustness of Gaussian Codebooks for Additive-Noise Channels

Ioannis Kontoyiannis, Lampros Gavalakis, Mokshay Madiman
article en
1 citations

Abstract

Entropy comparison inequalities are obtained for the differential entropy <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$h(X+Y)$ </tex-math></inline-formula> of the sum of two independent random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, when one is replaced by a Gaussian. For identically distributed random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, these are closely related to bounds on the entropic doubling constant, which quantifies the entropy increase when adding an independent copy of a random vector to itself. Consequences of both large and small doubling are explored. For the former, lower bounds are deduced on the entropy increase when adding an independent Gaussian, while for the latter, a qualitative stability result for the entropy power inequality is obtained. In the more general case of non-identically distributed random vectors <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$X,Y$ </tex-math></inline-formula>, a Gaussian comparison inequality with interesting implications for channel coding is established: For additive-noise channels with a power constraint, Gaussian codebooks come within a <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\frac {\mathsf { snr}}{3{\mathsf { snr}}+2}$ </tex-math></inline-formula> factor of capacity. In the low-SNR regime this improves the half-a-bit additive bound of Zamir and Erez. Analogous results are obtained for additive-noise multiple access channels, and for linear, additive-noise

IEEE Transactions on Information TheoryVol. 70(12)
Centre National de la Recherche Scientifique (FR), Université Paris-Est Créteil (FR), University of Cambridge (GB), Laboratoire d’Analyse et de Mathématiques Appliquées (FR), Université Gustave Eiffel (FR), University of Delaware (US)
HORIZON EUROPE Marie Sklodowska-Curie Actions
Openalex Percentile: Top 47%
Advanced Data Compression Techniques
0.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.