Metraipolis › archive › dc_aa9916cbbb1f
Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels — arXiv:2611.04647
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04647
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:49:14.798Z
- SHA-256 of the archived text
c8c7e065c927db39ad7d2c7e225207b4c7e4de2ed79fec7fb8d2ac255b4411c4- Stable URL of this page
https://metraipolis.com/documento/dc_aa9916cbbb1f
How to cite
Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels — arXiv:2611.04647 — arXiv (en), https://arxiv.org/abs/2611.04647 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aa9916cbbb1f (Metraipolis archive dc_aa9916cbbb1f, sha256 c8c7e065c927db39ad7d2c7e225207b4c7e4de2ed79fec7fb8d2ac255b4411c4)
BibTeX
@misc{dcaa9916cbbb1f,
title = {Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels — arXiv:2611.04647},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04647},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aa9916cbbb1f; sha256 c8c7e065c927db39ad7d2c7e225207b4c7e4de2ed79fec7fb8d2ac255b4411c4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04647. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates non-asymptotic achievable rate regions of Gaussian multiple-access channels (MACs) and broadcast channels (BCs) in the finite-blocklength regime. By employing a proposed volume-uniform random coding (VURC) codebook that distributes codewords uniformly within an $n$-dimensional power sphere, together with successive interference cancellation (SIC) decoding, we derive a closed-form achievability bound, a scheme-specific lower bound on the average error probability, and a fourth-order asymptotic characterization. The proposed SIC achievability bound admits a simple and analytically interpretable closed-form expression, enabling direct performance evaluation without iterative computation. The structure of the proposed SIC asymptotic bound offers a highly extensible framework, allowing advances in single-user finite-blocklength theory to be systematically incorporated into the multiuser setting. Futhermore, to characterize the performance benefit of joint decoding, we further derive numerical and closed-form achievability bounds for the two-user Gaussian MAC under joint nearest-neighbor (JNN) decoding. Numerical results illustrate the performance differences among the proposed SIC and JNN bounds and existing benchmarks. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno). Categorie arXiv: Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2611.04647 — 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-11-04T12:32:47.119Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).