English
Related papers

Related papers: Duality and Stability Regions of Multi-rate Broadc…

200 papers

In this paper, we study the problem of secret communication over a Compound Multiple Access Channel (MAC). In this channel, we assume that one of the transmitted messages is confidential that is only decoded by its corresponding receiver…

Information Theory · Computer Science 2016-11-17 Hassan Zivari-Fard , Bahareh Akhbari , Mahmoud Ahmadian-Attari , Mohammad Reza Aref

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

In this paper, capacity inner and outer bounds are established for the multiuser channels with Channel State Information (CSI) known non-causally at the transmitters: The Multiple Access Channel (MAC), the Broadcast Channel (BC) with common…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani , Farokh Marvasti

This paper studies system stability and performance of multi-agent systems in the context of consensus problems over wireless multiple-access channels (MAC). We propose a consensus algorithm that exploits the broadcast property of the…

Systems and Control · Computer Science 2018-04-30 Fabio Molinari , Sławomir Stańczak , Jörg Raisch

In this paper, the fundamental limits of decentralized simultaneous information and energy transmission in the $K$-user Gaussian multiple access channel (G-MAC), with an arbitrary $K \geqslant 2$ and one non-colocated energy harvester (EH),…

Information Theory · Computer Science 2017-09-27 Selma Belhadj Amor , Samir M. Perlaza , H. Vincent Poor

We study the Gaussian multiple access channel with random user activity, in the regime where the number of users is proportional to the code length. The receiver may know some statistics about the number of active users, but does not know…

Information Theory · Computer Science 2025-10-21 Xiaoqi Liu , Pablo Pascual Cobo , Ramji Venkataramanan

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two…

Information Theory · Computer Science 2016-11-15 Shashank Vatedka , Navin Kashyap , Andrew Thangaraj

This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. Both transmitter and jammer are subject to power constraints which can be enforced over each codeword short-term…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei

The stability of Bernstein's characterization of Gaussian distributions is extended to vectors by utilizing characteristic functions. Stability is used to develop a soft doubling argument that establishes the optimality of Gaussian vectors…

Information Theory · Computer Science 2023-08-15 Mohammad Mahdi Mahvari , Gerhard Kramer

A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless, this assumption…

Information Theory · Computer Science 2025-01-31 Homa Nikbakht , Malcolm Egan , Jean-Marie Gorce , H. Vincent Poor

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti

In this paper, we propose a multi-channel full-duplex Medium Access Control (MAC) protocol for cognitive radio networks (MFDC-MAC). Our design exploits the fact that full-duplex (FD) secondary users (SUs) can perform spectrum sensing and…

Information Theory · Computer Science 2016-02-02 Tan Le Thanh , Long Bao Le

The two-user computation broadcast problem is introduced as the setting where User $1$ wants message $W_1$ and has side-information $W_1'$, User $2$ wants message $W_2$ and has side-information $W_2'$, and $(W_1, W_1', W_2, W_2')$ may have…

Information Theory · Computer Science 2019-03-19 Hua Sun , Syed A. Jafar

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

We investigate the capacity region of multi-user interference channels (IC), where each user encodes multiple sub-user components. By unifying chain-rule decomposition with the Entropy Power Inequality (EPI), we reason that single-user…

Information Theory · Computer Science 2025-01-28 Sagnik Bhattacharya , Abhiram Rao Gorle , Muhammad Ali Mohsin , John M. Cioffi

This work concerns the behavior of "good" (capacity achieving) codes in several multi-user settings in the Gaussian regime, in terms of their minimum mean-square error (MMSE) behavior. The settings investigated in this context include the…

Information Theory · Computer Science 2015-02-26 Ronit Bustin , Rafael F. Schaefer , H. Vincent Poor , Shlomo Shamai

We consider the achievable average rates of a multiple-access system, which consists of N energy-harvesting users (EHUs) that transmit information over a block fading multiple-access channel (MAC) and a base station (BS) that broadcasts…

Information Theory · Computer Science 2014-09-22 Zoran Hadzi-Velkov , Nikola Zlatanov , Robert Schober

This paper considers the Gaussian multiple-access channel (MAC) in the asymptotic regime where the number of users grows linearly with the code length. We propose efficient coding schemes based on random linear models with approximate…

Information Theory · Computer Science 2022-05-04 Kuan Hsieh , Cynthia Rush , Ramji Venkataramanan

This paper proposes a new model called \emph{spatial continuum asymmetric channels} to study the channel capacity region of asymmetric scenarios in which either one source transmits to a spatial density of receivers or a density of…

Information Theory · Computer Science 2016-02-03 Jean-Marie Gorce , H. Vincent Poor , Jean-Marc Kelif

In optical wireless communications, a broadcast channel (BC) employing intensity modulation and direct detection (IM/DD) is often modelled as a peak-constrained BC. A closed-form expression for its capacity region of the peak-constrained BC…

Information Theory · Computer Science 2022-08-25 Zhenyu Charlus Zhang , Anas Chaaban