Computer Science > Information Theory
[Submitted on 8 Dec 2022
(v1)
, last revised 14 Aug 2023 (this version, v2)]
Title: Stability of Bernstein's Theorem and Soft Doubling for Vector Gaussian Channels
Title: 伯恩斯坦定理的稳定性及向量高斯信道的软加倍
Abstract: The stability of Bernstein's characterization of Gaussian distributions is extended to vectors by utilizing characteristic functions. Stability is used to develop a soft doubling argument that establishes the optimality of Gaussian vectors for certain communications channels with additive Gaussian noise, including two-receiver broadcast channels. One novelty is that the argument does not require the existence of distributions that achieve capacity.
Submission history
From: Mohammad Mahdi Mahvari [view email][v1] Thu, 8 Dec 2022 18:55:18 UTC (37 KB)
[v2] Mon, 14 Aug 2023 07:43:57 UTC (514 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender
(What is IArxiv?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.