Related papers: An upper bound on relaying over capacity based on …
The interference channel with a cognitive relay consists of a classical interference channel with two sourcedestination pairs and with an additional cognitive relay that has a priori knowledge of the sources' messages and aids in the…
Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels.…
This paper focuses on the capacity of point-to-point relay communications wherein the transmitter is assisted by an intermediate relay. We detail the mathematical model of cutset and amplify and forward (AF) relaying strategy. We present…
The multi-way relay channel is a multicast network where L users exchange data through a relay. In this paper, the capacity region of a class of multi-way relay channels is derived, where the channel inputs and outputs take values over…
We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been derived, such…
A network where three users communicate with each other via a relay is considered. Users do not receive other users' signals via a direct link, and thus the relay is essential for their communication. Each user is assumed to have an…
The linear shift deterministic Y-channel is studied. That is, we have three users and one relay, where each user wishes to broadcast one message to each other user via the relay, resulting in a multi-way relaying setup. The cut-set bounds…
We study the capacity region of a deterministic 4-node network, where 3 nodes can only communicate via the fourth one. However, the fourth node is not merely a relay since it can exchange private messages with all other nodes. This…
The primitive relay channel, introduced by Cover in 1987, is the simplest single-source single-destination network model that captures some of the most essential features and challenges of relaying in wireless networks. Recently, Wu and…
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…
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…
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…
The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers' outputs, three types of…
We derive a new upper bound on the reliability function for channel coding over discrete memoryless channels. Our bounding technique relies on two main elements: (i) adding an auxiliary genie-receiver that reveals to the original receiver a…
This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on…
An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…
A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Inner and outer bounds on…
Memoryless channels with deletion errors as defined by a stochastic channel matrix allowing for bit drop outs are considered in which transmitted bits are either independently deleted with probability $d$ or unchanged with probability…
In the binary online (or "causal") channel coding model, a sender wishes to communicate a message to a receiver by transmitting a codeword $\mathbf{x} =(x_1,\ldots,x_n) \in \{0,1\}^n$ bit by bit via a channel limited to at most $pn$…
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. Outer and inner bounds on the capacity region are derived when the…