Related papers: The Poisson Channel with Side Information
We consider the problem of communicating over a channel that randomly "tears" the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\rm…
The upper bound on the capacity of a 3-node discrete memoryless relay channel is considered, where a source X wants to send information to destination Y with the help of a relay Z. Y and Z are independent given X, and the link from Z to Y…
The present paper is devoted to investigation of the classical capacity of infinite-dimensional quantum measurement channels. A number of usable conditions are introduced that enable us to apply previously obtained general results to…
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 characterize the capacity for the discrete-time arbitrarily varying channel with discrete inputs, outputs, and states when (a) the encoder and decoder do not share common randomness, (b) the input and state are subject to cost…
This paper studies on-chip communication with non-ideal heat sinks. A channel model is proposed where the variance of the additive noise depends on the weighted sum of the past channel input powers. It is shown that, depending on the…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
A simple lower bound to the capacity of the discrete-time Poisson channel with average energy $\es$ is derived. The rate ${1/2}\log(1+\es)$ is shown to be the generalized mutual information of a modified minimum-distance decoder, when the…
Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…
We first investigate two-user nonasymmetric sum-rate Poisson capacity with non-perfect photoncounting receiver under certain condition and demonstrate three possible transmission strategy, including only one active user and both active…
Arbitrarily varying channels offer a powerful framework for analyzing the robustness of quantum communication systems, especially for classical-quantum models, where the analysis displays strengths or weaknesses of specific signal…
Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…
In this paper, we show that nested lattice codes achieve the capacity of arbitrary channels with or without non-casual state information at the transmitter. We also show that nested lattice codes are optimal for source coding with or…
Quantum capacity quantifies the amount of quantum information that can be transmitted by a quantum channel with an arbitrary small probability of error. Mathematically, the quantum capacity is given by an asymptotic formula involving the…
We analyze the communication efficiency of quantum information transfer along unmodulated spin chains by computing the communication rates of various protocols. The effects of temporal correlations are discussed, showing that they can be…
For a quantum channel of additive Gaussian noise with loss, in the general case of $n$ copies input, we show that up to first order perturbation, any non-Gaussian perturbation to the product thermal state input has a less quantum…
The capacity of the semideterministic discrete memoryless broadcast channel (SD-BC) with partial message side-information (P-MSI) at the receivers is established. In the setting without a common message, it is shown that P-MSI to the…
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 the communication scenario where multiple cognitive users wish to communicate to the same receiver, in the presence of primary transmission. The cognitive transmitters are assumed to have the side information about the primary…
We consider a continuous-time bandlimited additive white Gaussian noise channel with 1-bit output quantization. On such a channel the information is carried by the temporal distances of the zero-crossings of the transmit signal. The set of…