Related papers: Universal communication part I: modulo additive ch…
We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel with memory, where the noise sequence is a Gaussian vector…
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…
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 communication over a multiple-input single-output (MISO) block fading channel in the presence of an independent noiseless feedback link. We assume that the transmitter and receiver have no prior knowledge of the channel state…
Quantum network is the key to enable distributed quantum information processing. As the single-link communication rate decays exponentially with the distance, to enable reliable end-to-end quantum communication, the number of nodes needs to…
We introduce an infinite sequence of quantum channels for which the Holevo capacity is additive. The channel series is closely related to the quantum channels arising from universal quantum cloning machines. The additivity proof is…
Under which condition is quantization optimal? We address this question in the context of the additive uniform noise channel under peak amplitude and cost constraints. We compute analytically the capacity-achieving input distribution as a…
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in…
We derive universal codes for transmission of broadcast and confidential messages over classical-quantum-quantum and fully quantum channels. These codes are robust to channel uncertainties considered in the compound model. To construct…
A state-dependent discrete memoryless multiple access channel is considered to model an integrated sensing and communication system, where two transmitters wish to convey messages to a receiver while simultaneously estimating the state…
In this paper, we revisit the problem of finding the average capacity of the Gaussian feedback channel. First, we consider the problem of finding the average capacity of the analog Gaussian noise channel where the noise has an arbitrary…
We introduce a general framework for treating channels with memory and feedback. First, we generalize Massey's concept of directed information and use it to characterize the feedback capacity of general channels. Second, we present coding…
The notion of the Holevo capacity for arbitrarily constrained infinite dimensional quantum channels is introduced. It is shown that despite nonexistence of an optimal ensemble in this case it is possible to define the notion of the output…
For information transmission a discrete time channel with independent additive Gaussian noise is used. There is also feedback channel with independent additive Gaussian noise, and the transmitter observes without delay all outputs of 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…
The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…
A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…
The quantum capacity of degradable quantum channels has been proven to be additive. On the other hand, there is no general rule for the behavior of quantum capacity for non-degradable quantum channels. We introduce the set of partially…
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…
A discrete compound channel with memory is considered, where no stationarity, ergodicity or information stability is required, and where the uncertainty set can be arbitrary. When the discrete noise is additive but otherwise arbitrary and…