Related papers: Bounds and Capacity Theorems for Cognitive Interfe…
This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…
The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network,…
This paper studies the problem of interference channels with one cognitive transmitter (ICOCT) where "cognitive" is defined from both the noncausal and causal perspectives. For the noncausal ICOCT, referred to as interference channels with…
The maximum rates for information transmission through noisy quantum channels has primarily been developed for memoryless channels, where the noise on each transmitted state is treated as independent. Many real world communication channels…
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.…
In this paper, taking into account the effect of link delays, we investigate the capacity region of the Cognitive Interference Channel (C-IFC), where cognition can be obtained from either causal or non-causal generalized feedback. For this…
An interference channel is said to have strong interference if for all input distributions, the receivers can fully decode the interference. This definition of strong interference applies to discrete memoryless, scalar and vector Gaussian…
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is…
We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…
The two-receiver broadcast packet erasure channel with feedback and memory is studied. Memory is modeled using a finite-state Markov chain representing a channel state. The channel state is unknown at the transmitter, but observations of…
We derive the capacity region of the state-dependent semideterministic broadcast channel with noncausal state-information at the transmitter. One of the two outputs of this channel is a deterministic function of the channel input and the…
In this paper, we first consider a channel that is contaminated by two independent Gaussian noises $S ~ N(0,Q)$ and $Z_0 ~ N(0,N_0)$. The capacity of this channel is computed when independent noisy versions of $S$ are known to the…
We generalize the problem of controlling the interference created to an external observer while communicating over a discrete memoryless channel (DMC) which was studied in \cite{serrano:2014}. In particular, we consider the scenario where…
In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that both the secondary receiver and the secondary transmitter know the channel fading…
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…
We study the interference channel with a signal cognitive relay. A signal cognitive relay knows the transmit signals (but not the messages) of the sources non-causally, and tries to help them communicating with their respective…
Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…
The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially…
The fact that the results for 2-receiver broadcast channels (BCs) are not generalized to the 3-receiver ones is of information theoretical importance. In this paper we study two classes of discrete memoryless BCs with non-causal side…
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be…