Related papers: Treating Interference as Noise is Optimal for Cove…
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages,…
In this paper, we consider a scenario of covert communication aided by multiple friendly interference nodes. The objective is to conceal the legitimate communication link under the surveillance of a warden. The main content is as follows:…
One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…
We consider a $K$-user interference network with $M$ states, where each transmitter has $M$ messages and over State $m$, Receiver $k$ wishes to decode the first $\pi_k(m) \in \{1,2,\cdots,M\}$ messages from its desired transmitter. This…
The topological interference management (TIM) problem refers to the study of the K-user partially connected interference networks with no channel state information at the transmitters (CSIT), except for the knowledge of network topology. In…
In a K-user Gaussian interference channel, it has been shown by Geng et al. that if for each user the desired signal strength is no less than the sum of the strengths of the strongest interference from this user and the strongest…
In this paper, we look at the problem of treating interference as noise (TIN) in the Gaussian interfering multiple access channel (IMAC). The considered network comprises $K$ mutually interfering multiple access channels (MACs), each…
We consider a secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using…
Secret key establishment leveraging the physical layer as a source of common randomness has been investigated in a range of settings. We investigate the problem of establishing, in an information-theoretic sense, a secret key between a user…
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…
In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…
In this paper, we explore the information-theoretic optimality of treating interference as noise (TIN) in cellular networks. We focus on uplink scenarios modeled by the Gaussian interfering multiple access channel (IMAC), comprising $K$…
We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user…
We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…
We consider secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian…
This paper considers the K user cognitive interference channel with one primary and K-1 secondary/cognitive transmitters with a cumulative message sharing structure, i.e cognitive transmitter $i\in [2:K]$ knows non-causally all messages of…
We propose a covert communication protocol for the spread-spectrum multiple random access with additive white Gaussian noise (AWGN) channel. No existing paper has studied covert communication for the random access channel. Our protocol…
We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…
We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden, may arbitrarily choose the channel state. We develop an…
The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two…