Papers › On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation...

On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective

23 Apr 2018arXiv:1804.08524links table onlyarchive 2025-07-28

Alex Dytso, Mert Al, H. Vincent Poor, Shlomo Shamai

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

This paper studies the capacity of an n-dimensional vector Gaussian noise channel subject to the constraint that an input must lie in the ball of radius R centered at the origin. It is known that in this setting the optimizing input distribution is supported on a finite number of concentric spheres. However, the number, the positions and the probabilities of the spheres are generally unknown. This paper characterizes necessary and sufficient conditions on the constraint R such that the input distribution supported on a single sphere is optimal. The maximum R̅ₙ, such that using only a single sphere is optimal, is shown to be a solution of an integral equation. Moreover, it is shown that R̅ₙ scales as √(n) and the exact limit of (R̅ₙ)/(√(n)) is found.

PaperPDFCode

Code

almert/peak-power mentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections