Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis

DOI10.1109/TIT.2021.3111676MaRDI QIDQ5032551zbMATH OpenFDO

Authors Recep Can Yavas, Victoria Kostina, Michelle Effros

Publication date 17 February 2022

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2021.3111676

zbMATH Keywords

Gaussian multiple access channelrandom access channelaverage-error constraintsfinite-blocklength achievability boundsmaximal-power constraints

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited in

(7)

• Decentralized K-User Gaussian Multiple Access Channels
• Minimum probability of error for asynchronous Gaussian multiple-access channels
• Shannon-theoretic approach to a Gaussian cellular multiple-access channel
• On the Duality of Gaussian Multiple-Access and Broadcast Channels
• Arbitrarily varying multiple-access channels. I. Ericson's symmetrizability is adequate, Gubner's conjecture is true
• Free Deterministic Equivalents for the Analysis of MIMO Multiple Access Channel
• Unsourced random access

This page was built for publication: Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032551)