We consider a linear Gaussian noise channel used with delayed feedback. The channel noise is assumed to be an ARMA (autoregressive and/or moving average) process. We reformulate the Gaussian noise channel into an intersymbol interference channel with white noise, and show that the delayed-feedback of the original channel is equivalent to the instantaneous-feedback of the derived channel. By gen...

We show that the minimum output entropy for all single-mode Gaussian channels is additive and is attained for Gaussian inputs. This allows the derivation of the channel capacity for a number of Gaussian channels, including that of the channel with linear loss, thermal noise, and linear amplification.

Receivers require channel state information (CSI) to be able to detect the transmitted information. Therefore the channel has to be estimated. This imperfect channel knowledge results in an extra noise term at the receiver side. In this paper, the influence of a Gaussian channel estimation error on the performance of a linear Minimum Mean Squared Error (MMSE) Finite Impulse Response (FIR) equal...

In this paper, the posterior matching scheme proposed by Shayevits and Feder is extended to the Gaussian broadcast channel with feedback, and the error probabilities and achievable rate region are derived for this coding strategy by using the iterated random function theory. A variant of the Ozarow-Leung code for the general two-user broadcast channel with feedback can be realized as a special ...

Wyner’s results for discrete memoryless wire-tap channels are extended to the Gaussian wire-tap channel. It is shown that the secrecy capacity C, is the difference between tbe capacit ies of the main and wire-tap channels. It is further shown tbat Rd= C, is the upper boundary of the achievable rate-equivocation region.

The problem of transmitting an i.i.d Gaussian source over an i.i.d Gaussian wiretap channel with an i.i.d Gaussian side information is considered. The intended receiver is assumed to have a certain minimum SNR and the eavesdropper is assumed to have a strictly lower SNR compared to the intended receiver. The objective is minimizing the distortion of source reconstruction at the intended receive...

The noisy channel coding theorem that we have proved shows that there exist`very good' error correcting codes for any noisy channel. In this chapter we address two questions. First, many practical channels have real, rather than discrete, inputs and outputs. How should digital signals be mapped into analogue waveforms, and vice-versa? Secondly, how are practical error correcting codes made, and...

In this paper, a Gaussian multiple input multiple output multiple eavesdropper (MIMOME) channel is considered where a transmitter communicates to a receiver in the presence of an eavesdropper. We present a technique for determining the secrecy capacity of the multiple input multiple output (MIMO) channel under Gaussian noise. We transform the degraded MIMOME channel into multiple single input m...

A simple lemma is derived that allows to transform a general scalar (non-Gaussian, non-additive) continuousalphabet channel as well as a general multiple-access channel into a modulo-additive noise channel. While in general the transformation is information lossy, it allows to leverage linear coding techniques and capacity results derived for networks comprised of additive Gaussian nodes to mor...