Related papers: Optimal Achievable Rates for Interference Networks…
Allowing the input auxiliary random variables to be correlated and using the binning scheme, the Han-Kobayashi (HK) rate region for general interference channel is partially improved. The obtained partially new achievable rate region (i) is…
The Han-Kobayashi (HK) scheme achieves the best known achievable rate region for the K user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing, and no private-common power splitting. The…
We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding…
We study a special class of the cognitive radio channel in which the receiver of the cognitive pair does not suffer interference from the primary user. Previously developed general encoding schemes for this channel are complex as they…
In this paper, we investigate optimal coding strategies for a class of linear deterministic relay networks. The network under study is a relay network, with one source, one destination, and two relay nodes. Additionally, there is a…
For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…
An index code for a broadcast channel with receiver side information is 'locally decodable' if every receiver can decode its demand using only a subset of the codeword symbols transmitted by the sender instead of observing the entire…
In an M x N interference network, there are M transmitters and N receivers with each transmitter having independent messages for each of the 2^N -1 possible non-empty subsets of the receivers. We consider the 2 x 2 interference network with…
Allowing the input auxiliary random variables to be correlated and using the binning scheme, the Han- Kobayashi (HK) rate region for general interference channel is improved. The obtained new achievable rate region (i) is shown to encompass…
Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for four interesting networks…
For a multi-user interference channel with multi-antenna transmitters and single-antenna receivers, by restricting each receiver to a single-user detector, computing the largest achievable rate region amounts to solving a family of…
The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed…
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,…
Quantum and private communications are affected by a fundamental limitation which severely restricts the optimal rates that are achievable by two distant parties. To overcome this problem, one needs to introduce quantum repeaters and, more…
Calculating the capacity of interference channels is a notorious open problem in classical information theory. Such channels have two senders and two receivers, and each sender would like to communicate with a partner receiver. The capacity…
This paper presents the achievable rate region frontiers for the n-user interference channel when there is no cooperation at the transmit nor at the receive side. The receiver is assumed to treat the interference as additive thermal noise…
Interference is a major issue limiting the performance in wireless networks. Cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited in most…
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…
We study opportunistic interference management when there is bursty interference in parallel 2-user linear deterministic interference channels. A degraded message set communication problem is formulated to exploit the burstiness of…
This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…