Related papers: On the Achievable Rate Regions for Interference Ch…
We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is…
An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…
The best known inner bound for the 2-user discrete memoryless interference channel is the Han-Kobayashi rate region. The coding schemes that achieve this region are based on rate-splitting and superposition coding. In this paper, we develop…
This work investigates the general two-user Compound Broadcast Channel (BC) where an encoder wishes to transmit common and private messages to two receivers while being oblivious to two possible channel realizations controlling the…
This paper studies a Gaussian Z-interference channel with a rate-limited digital relay link from one receiver to another. Achievable rate regions are derived based on a combination of Han-Kobayashi common-private information splitting…
This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…
This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. We consider a special class of two-user Gaussian interference channels…
The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…
The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…
The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…
In this paper, we establish achievable rate regions for the multiple access channel (MAC) with side information partially known (estimated or sensed version) at the transmitters. Actually, we extend the lattice strategies used by…
Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…
An achievable rate region for the Gaussian interference channel is derived using Sato's modified frequency division multiplexing idea and a special case of Han and Kobayashi's rate region (denoted by $\Gmat^\prime$). We show that the new…
In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and…
A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver,…
The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…
Diffusive molecular communications (DiMC) have recently gained attention as a candidate for nano- to micro- and macro-scale communications due to its simplicity and energy efficiency. As signal propagation is solely enabled by Brownian…
We consider the Gaussian Dirty Tape Channel (DTC) Y=X+S+Z, where S is an additive Gaussian interference known causally to the transmitter. The general expression [max]\_top(P_U,f(.),X=f(U,S))I(U;Y) is presented for the capacity of this…
The cognitive interference channel with unidirectional destination cooperation (CIFC-UDC) is a variant of the cognitive interference channel (CIFC) where the cognitive (secondary) destination not only decodes the information sent from its…
In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and…