We investigate the capacity of bosonic quantum channels for the transmission of quantum information. We calculate the quantum capacity for a class of Gaussian channels, including channels describing optical fibers with photon losses, by proving that Gaussian encodings are optimal. For arbitrary channels we show that achievable rates can be determined from few measurable parameters by proving th...

We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of introducing more than one additional auxiliary random variable, which was previously used to derive sum-rate lower bound for the symmetric Gaussian multiple descr...

A recent result of the authors shows a so-called I-MMSE-like relationship that, for the two-user Gaussian interference channel, an I-MMSE relationship holds in the limit, as n → ∞, between the interference and the interfered-with receiver, assuming that the interfered-with transmission is an optimal point-to-point sequence (achieves the point-to-point capacity). This result was further used to ...

A scheme for powerand bandwidth-efficient communication on the linear Gaussian channel is proposed. A scenario is assumed in which the channel is stationary in time and the channel characteristics are known at the transmitter. Using interleaving, the linear Gaussian channel with its intersymbol interference is decomposed into a set of memoryless subchannels. Each subchannel is further decompose...

Broadband frequency-selective fading channels usually have the inherent sparse nature. By exploiting the sparsity, adaptive sparse channel estimation (ASCE) methods, e.g., reweighted L1-norm least mean square (RL1-LMS), could bring a performance gain if additive noise satisfying Gaussian assumption. In real communication environments, however, channel estimation performance is often deteriorate...

We study the performance of a transmission scheme employing random Gaussian codebooks and nearest neighbor decoding over a power limited additive non-Gaussian noise channel. We show that the achievable rates depend on the noise distribution only via its power and thus coincide with the capacity region of a white Gaussian noise channel with signal and noise power equal to those of the original c...

We derive a closed-form expression for the capacity of the additive-Gaussian-noise memoryless channel with binary input. The capacity expression that we obtain contains an infinite series. Truncation of the series -for computation reasonsat an odd or even number of terms results in a lower or upper, respectively, bound on the channel capacity; we prove that the tightness of the bound increases ...

This paper focuses on Byzantine attack detection for Gaussian two-way relay network. In this network, two source nodes communicate with each other with the help of an amplify-and-forward relay which may perform Byzantine attacks by forwarding altered symbols to the sources. For simple investigating the detectability of attacks conducted in Gaussian channels, we focus on the MA channel of the ne...