Related papers: A Unified Scheme for Two-Receiver Broadcast Channe…
We consider a broadcast channel with 3 receivers and 2 messages (M0, M1) where two of the three receivers need to decode messages (M0, M1) while the remaining one just needs to decode the message M0. We study the best known inner and outer…
We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…
This paper establishes the capacity region of a class of broadcast channels with random state in which each channel component is selected from two possible functions and each receiver knows its state sequence. This channel model does not…
The problem of multicasting two nested messages is studied over a class of networks known as combination networks. A source multicasts two messages, a common and a private message, to several receivers. A subset of the receivers (called the…
We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…
We study the content delivery problem between a transmitter and two receivers through erasure links, when each receiver has access to some random side-information about the files requested by the other user. The random side-information is…
The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…
In this paper, capacity bounds for the two-user Interference Channel (IC) with cooperative receivers via conferencing links of finite capacities is investigated. The capacity results known for this communication scenario are limited to a…
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…
This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…
We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user…
This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…
The capacity of the Gaussian cognitive interference channel, a variation of the classical two-user interference channel where one of the transmitters (referred to as cognitive) has knowledge of both messages, is known in several parameter…
We consider achieving the rates in the capacity region of a multi-level 3-receiver broadcast channel, in which the second receiver is degraded with respect to the first receiver, with degraded message sets. We propose a two-level chaining…
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…
This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…
Three-receiver broadcast channel (BC) is of interest due to its information theoretical differences with two receiver one. In this paper, we derive achievable rate regions for two classes of 3-receiver BC with side information available at…
Consider the broadcast relay channel (BRC) which consists of a source sending information over a two user broadcast channel in presence of two relay nodes that help the transmission to the destinations. Clearly, this network with five nodes…
The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter-receiver pairs, in which the cognitive transmitter has the…
Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…