Reproduce “Non-asymptotic Sphere-Packing Bounds for Finite-Blocklength Scalar Gaussian Multiple-Access and Broadcast Channels” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Kaixuan Bao, Wei Xu, Xiaohu You
The authors analyze finite-blocklength decoding for a two-user Gaussian uplink using codewords drawn throughout the permitted power sphere, and derive bounds for successive and joint decoding. Their SIC bound has O(K²) evaluation complexity, compared with O(2^K) for cited methods. At n=50, the VURC+JNN numerical bound gives the largest displayed achievable region, only in the stated setup.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.