Related papers: Multicoding Schemes for Interference Channels
The optimal rate region for interference networks is characterized when encoding is restricted to random code ensembles with superposition coding and time sharing. A simple simultaneous nonunique decoding rule, under which each receiver…
In this paper, we study the capacity of the two-user multiple-input multiple-output (MIMO) linear deterministic interference channel (IC), with possible correlations within/between the channel matrices. The capacity region is characterized…
Motivated by the broadcast view of the interference channel, the new problem of communication with disturbance constraints is formulated. The rate-disturbance region is established for the single constraint case and the optimal encoding…
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…
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…
The randomized fixe-composition with optimal decoding error exponents are studied \cite{Raul_ISIT,Raul_journal} for the finite alphabet interference channel (IFC) with two transmitter-receiver pairs. In this paper we investigate the…
In this paper, we first study a two-user interference channel with generalized feedback. We establish an inner bound on its capacity region. The coding scheme that we employ for the inner bound is based on an appropriate combination of…
A low-complexity coding scheme is developed to achieve the rate region of maximum likelihood decoding for interference channels. As in the classical rate-splitting multiple access scheme by Grant, Rimoldi, Urbanke, and Whiting, the proposed…
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A channel in this class has the property that, for 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…
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 first propose two coding schemes for the discrete…
This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…
In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…
The cognitive interference channel is an interference channel in which one transmitter is non-causally provided with the message of the other transmitter. This channel model has been extensively studied in the past years and capacity…
The discrete memoryless interference channel is modelled as a conditional probability distribution with two outputs depending on two inputs and has widespread applications in practical communication scenarios. In this paper, we introduce…
In the presence of multiple senders, one of the simplest decoding strategies that can be employed by a receiver is successive decoding. In a successive decoding strategy, the receiver decodes the messages one at a time using the knowledge…
The two-user interference channel is a model for multi one-to-one communications, where two transmitters wish to communicate with their corresponding receivers via a shared wireless medium. Two most common and simple coding schemes are time…
An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…
Han-Kobayashi achievable region is the best known inner bound for a general discrete memoryless interference channel. We show that the capacity region can be strictly larger than the Han-Kobayashi region for some channel realizations, and…
The problem of joint source-channel coding in transmitting independent sources over interference channels with correlated receiver side information is studied. When each receiver has side information correlated with its own desired source,…