English
Related papers

Related papers: Parallel Gaussian Networks with a Common State-Cog…

200 papers

This paper considers a system where one transmitter broadcasts a single common message to two receivers linked by a bidirectional cooperation channel, which is assumed to be orthogonal to the downlink channel. Assuming a simplified setup…

Information Theory · Computer Science 2010-11-23 E. V. Belmega , B. Djeumou , S. Lasaulce

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in…

Information Theory · Computer Science 2023-03-22 Onur Günlü , Matthieu R. Bloch , Rafael F. Schaefer , Aylin Yener

In this paper, we consider fundamental communication limits over a compound channel. Covert communication in the information-theoretic context has been primarily concerned with fundamental limits when the transmitter wishes to communicate…

Information Theory · Computer Science 2019-06-18 Sadaf Salehkalaibar , Mohammad Hossein Yassaee , Vincent Y. F. Tan

This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…

Information Theory · Computer Science 2018-11-09 Christian Lameiro , Ignacio Santamaria , Peter J. Schreier

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of a classical two-user interference channel in which the two independent messages are also non-causally known at a cognitive relay node. In this work a special class of…

Information Theory · Computer Science 2011-02-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We study parallel symmetric 2-user interference channels when the interference is bursty and feedback is available from the respective receivers. Presence of interference in each subcarrier is modeled as a memoryless Bernoulli random state.…

Information Theory · Computer Science 2014-04-25 Shaunak Mishra , I-Hsiang Wang , Suhas Diggavi

In this paper we analyze a cognitive radio network with one primary and one secondary transmitter, in which the primary transmitter has bursty arrivals while the secondary node is assumed to be saturated (i.e. always has a packet waiting to…

Networking and Internet Architecture · Computer Science 2015-06-15 Nikolaos Pappas , Marios Kountouris

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

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

In this paper, we consider the finite-state multiple access channel (MAC) with partially cooperative encoders and delayed channel state information (CSI). Here partial cooperation refers to the communication between the encoders via…

Information Theory · Computer Science 2016-11-17 Ziv Goldfeld , Haim H. Permuter , Benjamin M. Zaidel

Consider the Gaussian wiretap channel, where a transmitter wishes to send a confidential message to a legitimate receiver in the presence of an eavesdropper. It is well known that if the eavesdropper experiences less channel noise than the…

Information Theory · Computer Science 2026-01-29 Vidhi Rana , Remi A. Chou , Taejoon Kim

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

In this paper, we consider the two-user single-input single-output (SISO) X-channel and $K$-user SISO X-network in fast fading environment. It is assumed that the transmitters have access to synergistic alternating channel state information…

Information Theory · Computer Science 2016-05-24 Ahmed Wagdy Shaban , Amr El-Keyi , Tamer Khattab , Mohammed Nafie

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We propose two coding schemes for the discrete…

Information Theory · Computer Science 2010-06-29 Lili Zhang , Jinhua Jiang , Shuguang Cui

Recent outer bounds on the capacity region of Gaussian interference channels are generalized to $m$-user channels with $m>2$ and asymmetric powers and crosstalk coefficients. The bounds are again shown to give the sum-rate capacity for…

Information Theory · Computer Science 2008-01-16 Xiaohu Shang , Gerhard Kramer , Biao Chen

In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that both the secondary receiver and the secondary transmitter know the channel fading…

Information Theory · Computer Science 2010-04-07 Sami Akin , Mustafa Cenk Gursoy

Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

We revisit the problem of Gaussian mean testing in a distributed, communication constrained setting, where each of $n$ users independently observes samples from an unknown $d$-dimensional spherical Gaussian distribution…

Data Structures and Algorithms · Computer Science 2026-05-29 Clément L. Canonne , Nimitt

The symmetric K user interference channel with fully connected topology is considered, in which (a) each receiver suffers interference from all other (K-1) transmitters, and (b) each transmitter has causal and noiseless feedback from its…

Information Theory · Computer Science 2012-12-24 Soheil Mohajer , Ravi Tandon , H. Vincent Poor

The scaling laws of the achievable communication rates and the corresponding upper bounds of distributed reception in the presence of an interfering signal are investigated. The scheme includes one transmitter communicating to a remote…

Information Theory · Computer Science 2009-12-08 Amichai Sanderovich , Michael Peleg , Shlomo Shamai