Metraipolis › archive › dc_8d08bc3919bf

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-04T19:01:52.010Z
SHA-256 of the archived text
f7754d6295d812ec9e4d9a9fb07ebeb473e0ab274ba4af7d08c007cfbf1c6643
Stable URL of this page
https://metraipolis.com/documento/dc_8d08bc3919bf

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_8d08bc3919bf (Metraipolis archive dc_8d08bc3919bf, sha256 f7754d6295d812ec9e4d9a9fb07ebeb473e0ab274ba4af7d08c007cfbf1c6643)
BibTeX
@misc{dc8d08bc3919bf,
  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_8d08bc3919bf; sha256 f7754d6295d812ec9e4d9a9fb07ebeb473e0ab274ba4af7d08c007cfbf1c6643},
  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-04T18:38:39.760Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).