Related papers: Interference Networks with General Message Sets: A…
Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…
Multi-resolution codes enable multicast at different rates to different receivers, a setup that is often desirable for graphics or video streaming. We propose a simple, distributed, two-stage message passing algorithm to generate network…
We consider the problem of coding over the multi-user Interference Channel (IC). It is well-known that aligning the interfering signals results in improved achievable rates in certain setups involving more than two users. We argue that in…
A new achievable rate region is given for the Gaussian cognitive many-to-one interference channel. The proposed novel coding scheme is based on the compute-and-forward approach with lattice codes. Using the idea of decoding sums of…
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…
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…
Wireless systems are increasingly used for Machine-Type Communication (MTC), where the users sporadically send very short messages. In such a setting, the overhead imposed by channel estimation is substantial, thereby demanding noncoherent…
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…
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…
It is known that for any general access structure, a secret sharing scheme (SSS) can be constructed from an (m,m)-threshold scheme by using the so-called cumulative map or from a (t,m)-threshold SSS by a modified cumulative map. However,…
The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…
This paper studies the value of limited rate cooperation between the transmitters for managing interference and simultaneously ensuring secrecy, in the 2-user Gaussian symmetric interference channel (GSIC). First, the problem is studied in…
This paper concerns the transmission of two independent Gaussian sources over a two-user decentralized interference channel, assuming that the transmitters are unaware of the instantaneous CSIs. The availability of the channel state…
An open-loop single-user multiple-input multiple-output communication scheme is considered where a transmitter, equipped with multiple antennas, encodes the data into independent streams all taken from the same linear code. The coded…
In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast…
The coded caching scheme proposed by Maddah-Ali and Niesen considers the delivery of files in a given content library to users through a deterministic error-free network where a common multicast message is sent to all users at a fixed rate,…
Much of the existing work on the broadcast channel focuses only on the sending of private messages. In this work we examine the scenario where the sender also wishes to transmit common messages to subsets of receivers. For an L user…
In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…
Multicasting is the general method of conveying the same information to multiple users over a broadcast channel. In this work, the Gaussian MIMO broadcast channel is considered, with multiple users and any number of antennas at each node. A…
In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the…