Related papers: Capacity Results for Intermittent X-Channels with …
This paper develops a new communication strategy, ergodic interference alignment, for the K-user interference channel with time-varying fading. At any particular time, each receiver will see a superposition of the transmitted signals plus…
This paper considers the problem of cognitive radios with partial-message information. Here, an interference channel setting is considered where one transmitter (the "cognitive" one) knows the message of the other ("legitimate" user)…
The sum capacity of a class of discrete memoryless interference channels is determined. This class of channels is defined analogous to the Gaussian Z-interference channel with weak interference; as a result, the sum capacity is achieved by…
This paper derives outer bounds on the secrecy capacity region of the 2-user Z interference channel (Z-IC) with rate-limited unidirectional cooperation between the transmitters. First, the model is studied under the linear deterministic…
A multiple access channel and a point-to-point channel sharing the same medium for communications are considered. We obtain an outer bound for the capacity region of this setup, and we show that this outer bound is achievable in some cases.…
We consider a cooperative two-user multiaccess channel in which the transmission is controlled by a random state. Both encoders transmit a common message and, one of the encoders also transmits an individual message. We study the capacity…
The Interference Channels (ICs) represent fundamental building blocks of wireless communication networks. Despite considerable progress in network information theory, available capacity results for ICs, specifically those with more than two…
We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…
The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed…
We consider a broadcast scenario where one transmitter communicates with two receivers under quality-of-service constraints. The transmitter initially employs superposition coding strategies with arbitrarily distributed signals and sends…
We derive a new outer bound on the capacity region of broadcast traffic in multiple input broadcast packet erasure channels with feedback, and extend this outer bound to packet erasure relay networks with feedback. We show the tightness of…
An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…
We explore the degrees of freedom of $M\times N$ user wireless $X$ networks, i.e. networks of $M$ transmitters and $N$ receivers where every transmitter has an independent message for every receiver. We derive a general outerbound on the…
In this paper, we derive outer bounds on the capacity region of two classes of the general two-user discrete memoryless broadcast channels with side-information at the transmitter. The first class comprises the classical broadcast channel…
This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…
We study a nonlinear fiber optical channel impaired by cross-phase modulation and dispersion from the viewpoint of an interference channel. We characterize an outer bound on the capacity region of simultaneously achievable rate pairs,…
In multi-user wireless packet networks interference, typically modeled as packet collision, is the throughput bottleneck. Users become aware of the interference pattern via feedback and use this information for contention resolution and for…
This paper addresses an interference channel consisting of $\mathbf{n}$ active users sharing $u$ frequency sub-bands. Users are asynchronous meaning there exists a mutual delay between their transmitted codes. A stationary model for…
We consider the problem of broadcast with common messages, and focus on the case that the common message rate $R_{\mathcal{A}}$, i.e., the rate of the message intended for all the receivers in the set $\mathcal{A}$, is the same for all the…
We study memoryless interference channels with gradual data arrival in the absence of feedback. The information bits arrive at the transmitters according to independent and asynchronous~(Tx-Tx asynchrony) Bernoulli processes with average…