Related papers: Consensus Capacity of Noisy Broadcast Channels
This work considers a communication scenario where the transmitter chooses a list of size K from a total of M messages to send over a noisy communication channel, the receiver generates a list of size L and communication is considered…
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…
We analyse a communication scenario over a particular causal broadcast channel whose state depends on a modulo sum. The receivers of the broadcast receive channel state information and collaborate to determine the channel state as to decode…
The capacity of a time-varying block-memoryless channel in which the transmitter and the receiver have access to (possibly different) noisy causal channel side information (CSI) is obtained. It is shown that the capacity formula obtained in…
This article studies distributed event-triggered consensus over unreliable communication channels. Communication is unreliable in the sense that the broadcast channel from one agent to its neighbors can drop the event-triggered packets of…
For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also another channel with independent additive Gaussian noise (the feedback channel), and the transmitter observes without delay…
We consider the discrete memoryless degraded broadcast channels with feedback. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this…
Information theoretic secret key agreement is impossible without making initial assumptions. One type of initial assumption is correlated random variables that are generated by using a noisy channel that connects the terminals. Terminals…
In this paper, a new and general version of Gaussian channel in presence of two-sided state information correlated to the channel input and noise is considered. Determining a general achievable rate for the channel and obtaining the…
We present a simple model of quantum communication where a noisy quantum channel may benefit from the addition of further noise at the decoding stage. We demonstrate enhancement of the classical information capacity of an amplitude damping…
A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…
We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…
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…
This paper establishes inner bounds on the secrecy capacity regions for the general 3-receiver broadcast channel with one common and one confidential message sets. We consider two setups. The first is when the confidential message is to be…
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…
Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly…
Modular methods to transform Byzantine consensus protocols into ones that are fast and communication efficient in the common cases are presented. Small and short protocol segments called layers are custom designed to optimize performance in…
We study the capacity regions of broadcast channels with binary inputs and symmetric outputs. We study the partial order induced by the more capable ordering of broadcast channels for channels belonging to this class. This study leads to…
We consider symmetric two-user Gaussian interference channel with common messages. We derive an upper bound on the sum capacity, and show that the upper bound is tight in the low interference regime, where the optimal transmission scheme is…
This paper considers a Gaussian broadcast channel with two unmatched degraded components, three particular messages, and a common message that is intended for all three receivers. It is shown that for this channel superposition coding and…