Related papers: Error Exponents for the Gaussian Channel with Acti…
The capacity of multiple-input multiple-output additive white Gaussian noise channels is investigated under peak amplitude constraints on the norm of the input vector. New insights on the capacity-achieving input distribution are presented.…
We study the potential employment of improper Gaussian signaling (IGS) in full-duplex cooperative settings with residual self-interference (RSI). IGS is recently shown to outperform traditional proper Gaussian signaling (PGS) in several…
We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum…
This paper addresses the detection of a stochastic process in noise from irregular samples. We consider two hypotheses. The \emph{noise only} hypothesis amounts to model the observations as a sample of a i.i.d. Gaussian random variables…
We study the two-user broadcast channel with degraded message sets and derive second-order achievability rate regions. Specifically, the channel noises are not necessarily Gaussian and we use spherical codebooks for both users. The weak…
The channel capacity of a nonlinear, dispersive fiber-optic link is revisited. To this end, the popular Gaussian noise (GN) model is extended with a parameter to account for the finite memory of realistic fiber channels. This finite-memory…
The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…
We consider the continuous-time ARMA(1,1) Gaussian channel and derive its feedback capacity in closed form. More specifically, the channel is given by $\boldsymbol{y}(t) =\boldsymbol{x}(t) +\boldsymbol{z}(t)$, where the channel input…
We consider the $K\geq 2$-user memoryless Gaussian broadcast channel (BC) with feedback and common message only. We show that linear-feedback schemes with a message point, in the spirit of Schalkwijk & Kailath's scheme for point-to-point…
We survey the state of the art for the proof of the quantum Gaussian optimizer conjectures of quantum information theory. These fundamental conjectures state that quantum Gaussian input states are the solution to several optimization…
In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…
This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…
Error probabilities of random codes for memoryless channels are considered in this paper. In the area of communication systems, admissible error probability is very small and it is sometimes more important to discuss the relative gap…
Optical channels, such as fibers or free-space links, are ubiquitous in today's telecommunication networks. They rely on the electromagnetic field associated with photons to carry information from one point to another in space. As a result,…
The efficacy of a specially constructed Gallager-type error-correcting code to communication in a Gaussian channel is being examined. The construction is based on the introduction of complex matrices, used in both encoding and decoding,…
In this paper, we consider encoding strategies for the Z-channel with noiseless feedback. We analyze the combinatorial setting where the maximum number of errors inflicted by an adversary is proportional to the number of transmissions,…
We derive the outage capacity of a bursty version of the amplify-and-forward (BAF) protocol for small signal-to-noise ratios when incremental relaying is used. We show that the ratio between the outage capacities of BAF and the cut-set…
We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the "data-processing bound," is the simplest and…
This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general…
This paper considers a general Gaussian relay network where a source transmits a message to a destination with the help of N half-duplex relays. It proves that the information theoretic cut-set upper bound to the capacity can be achieved to…