English
Related papers

Related papers: Near-Optimal Coding for Many-user Multiple Access …

200 papers

We study the problem of multi-access coded caching (MACC): a central server has $N$ files, $K$ ($K \leq N$) caches each of which stores $M$ out of the $N$ files, $K$ users each of which demands one out of the $N$ files, and each user…

Information Theory · Computer Science 2022-02-14 Niladri Das , B. Sundar Rajan

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

In this paper we study $\gamma$ partial correction over a $t$-user arbitrarily varying multiple-access channel (AV-MAC). We first present necessary channel conditions for the $\gamma$ partially correcting authentication capacity region to…

Information Theory · Computer Science 2024-07-26 Duncan Koepke , Michaela Schnell , Madelyn St. Pierre , Allison Beemer

The capacity region of a channel consists of all achievable rate vectors. Picking a particular point in the capacity region is synonymous with rate allocation. The issue of fairness in rate allocation is addressed in this paper. We review…

Information Theory · Computer Science 2007-07-13 Kenneth W. Shum , Chi Wan Sung

A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…

Information Theory · Computer Science 2010-11-01 Anas Chaaban , Aydin Sezgin

This paper studies the multi-access coded caching (MACC) problem with arbitrary user-cache access topology, which extends existing MACC models that rely on highly structured and combinatorially designed topologies. We consider a MACC system…

Information Theory · Computer Science 2026-05-08 Ting Yang , Kai Wan , Minquan Cheng , Xinping Yi , Robert Caiming Qiu , Giuseppe Caire

This paper studies the coherent and non-coherent multiuser multiple-input multiple-output (MU-MIMO) uplink system in the finite blocklength regime. The i.i.d. Gaussian codebook is assumed for each user. To be more specific, the BS first…

Information Theory · Computer Science 2022-10-04 Junjuan Feng , Hien Quoc Ngo , Michail Matthaiou

We consider distributed optimization over a $d$-dimensional space, where $K$ remote clients send coded gradient estimates over an {\em additive Gaussian Multiple Access Channel (MAC)} with noise variance $\sigma_z^2$. Furthermore, the…

Information Theory · Computer Science 2023-10-06 Shubham Jha

Conventional multi-user multiple-input multiple-output (MU-MIMO) mainly focused on Gaussian signaling, independent and identically distributed (IID) channels, and a limited number of users. It will be laborious to cope with the…

Information Theory · Computer Science 2022-09-20 Yuhao Chi , Lei Liu , Guanghui Song , Ying Li , Yong Liang Guan , Chau Yuen

This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple ($M$) receive antennas. We assume full or partial channel state information (CSI) at the receiver. It is known that to fully…

Information Theory · Computer Science 2023-07-04 Alexander Fengler , Alejandro Lancho , Yury Polyanskiy

Sparse Regression Codes (SPARCs) are capacity-achieving codes introduced for communication over the Additive White Gaussian Noise (AWGN) channels and were later extended to general memoryless channels. In particular it was shown via…

Information Theory · Computer Science 2024-09-10 Yuhao Liu , Yizhou Xu , Tianqi Hou

We consider an energy harvesting multiple access channel (MAC) where the transmitters are powered by an exogenous stochastic energy harvesting process and equipped with finite batteries. We characterize the capacity region of this channel…

Information Theory · Computer Science 2016-08-23 Huseyin A. Inan , Dor Shaviv , Ayfer Ozgur

We establish a multiuser extrinsic information transfer (EXIT) chart area theorem for the interleave-division multiple access (IDMA) scheme, a special form of superposition coding, in multiple access channels (MACs). A low-cost multi-user…

Information Theory · Computer Science 2019-07-29 Xiaojie Wang , Chulong Liang , Li Ping , Stephan ten Brink

This paper addresses the problem of distributed state estimation via multiple access channels (MACs). We consider a scenario where two encoders are simultaneously communicating their measurements through a noisy channel. Firstly, the…

Systems and Control · Electrical Eng. & Systems 2022-12-23 Ghassen Zafzouf , Girish N. Nair , Farhad Farokhi

We study the network spectral efficiency of decentralized vector multiple access channels (MACs) when the number of accessible dimensions per transmitter is strategically limited. Considering each dimension as a frequency band, we call this…

Information Theory · Computer Science 2009-05-19 Samir M. Perlaza , Merouane Debbah , Samson Lasaulce , Hanna Bogucka

In this work, we propose iterative access point (AP) selection (APS), linear minimum mean-square error (MMSE) precoding and power allocation techniques for Cell-Free Massive multiple-input multiple-output (MIMO) systems. We consider the…

Information Theory · Computer Science 2021-04-13 V. Palhares , A. R. Flores , R. C. de Lamare

In this paper, we focus on the two-user Gaussian interference channel (GIC), and study the Han-Kobayashi (HK) coding/decoding strategy with the objective of designing low-density parity-check (LDPC) codes. A code optimization algorithm is…

Information Theory · Computer Science 2014-05-27 Shahrouz Sharifi , A. Korhan Tanc , Tolga M. Duman

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

Adder MAC is a simple noiseless multiple-access channel (MAC), where if users send messages $X_1,\ldots,X_h\in \{0,1\}^n$, then the receiver receives $Y = X_1+\cdots+X_h$ with addition over $\mathbb{Z}$. Communication over the noiseless…

Information Theory · Computer Science 2018-09-21 Yuzhou Gu