Metraipolis › archive › dc_49b66ccac057
Second-Order Asymptotics for the Gaussian MAC on the Relative Interior of the Sum-Rate Face — arXiv:2609.18013
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.18013
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T16:14:02.803Z
- SHA-256 of the archived text
4ea4f0579e12f98c2d1f240367f10ff220a7b9c64f6b90b49594a1c96b6d9fed- Stable URL of this page
https://metraipolis.com/documento/dc_49b66ccac057
How to cite
Second-Order Asymptotics for the Gaussian MAC on the Relative Interior of the Sum-Rate Face — arXiv:2609.18013 — arXiv (en), https://arxiv.org/abs/2609.18013 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_49b66ccac057 (Metraipolis archive dc_49b66ccac057, sha256 4ea4f0579e12f98c2d1f240367f10ff220a7b9c64f6b90b49594a1c96b6d9fed)
BibTeX
@misc{dc49b66ccac057,
title = {Second-Order Asymptotics for the Gaussian MAC on the Relative Interior of the Sum-Rate Face — arXiv:2609.18013},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.18013},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_49b66ccac057; sha256 4ea4f0579e12f98c2d1f240367f10ff220a7b9c64f6b90b49594a1c96b6d9fed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.18013. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We completely characterize the second-order coding rate region of the two-user Gaussian multiple-access channel at points in the relative interior of the sum-rate face, under maximal per-codeword power constraints. For any fixed average error probability $0 < \varepsilon < 1/2$, a nontrivial mixture of power splits reduces the sum-rate dispersion and strictly improves upon standard inner bounds based on a constant power split. Thus, a constant power split, although sufficient to attain the first-order capacity region, is insufficient for second-order optimality in this regime. Our achievability proof builds on the constant composition and coded time-sharing framework of Scarlett, Martinez, and Guillén i Fàbregas, with an optimization over admissible power splits. A matching second-order converse establishes the optimality of the resulting coded time-sharing strategy. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-17 in math.IT). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.18013 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T15:40:33.214Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).