English
Related papers

Related papers: Secrecy Capacity of Colored Gaussian Noise Channel…

200 papers

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical…

Information Theory · Computer Science 2026-01-15 Sheng Su , Yuhan Yang , Chao Qi , Xuan He , Bin Dai , Xiaohu Tang

The feedback capacity of additive stationary Gaussian noise channels is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to the…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

The capacity of stationary additive Gaussian noise channels with feedback is characterized as the solution to a variational problem. Toward this end, it is proved that the optimal feedback coding scheme is stationary. When specialized to…

Information Theory · Computer Science 2007-07-13 Young-Han Kim

We study the problem of communication over an additive white Gaussian noise (AWGN) channel with an AWGN feedback channel. When the feedback channel is noiseless, the classic Schalkwijk-Kailath (S-K) scheme is known to achieve capacity in a…

Information Theory · Computer Science 2017-01-04 Assaf Ben-Yishai , Ofer Shayevitz

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…

Information Theory · Computer Science 2024-04-11 Jun Su , Guangyue Han , Shlomo Shamai

The Schalkwijk-Kailath (SK) scheme, which achieves the capacity of the point-to-point white Gaussian channel with feedback, is secure by itself and also achieves the secrecy capacity of the Gaussian wiretap channel with feedback, i.e., the…

Information Theory · Computer Science 2021-11-19 Bin Dai , Chong Li , Yingbin Liang , Zheng Ma , Shlomo Shamai

In this paper, we relate a feedback channel with any finite-order autoregressive moving-average (ARMA) Gaussian noises to a variant of the Kalman filter. In light of this, we obtain relatively explicit lower bounds on the feedback capacity…

Information Theory · Computer Science 2021-06-07 Song Fang , Quanyan Zhu

In this paper we derive closed-form formulas of feedback capacity and nonfeedback achievable rates, for Additive Gaussian Noise (AGN) channels driven by nonstationary autoregressive moving average (ARMA) noise (with unstable one poles and…

Information Theory · Computer Science 2021-06-10 Stelios Louka , Christos Kourtellaris , Charalambos D. Charalambous

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , D. Richard Brown , H. Vincent Poor

Consider a pair of terminals connected by two independent (feedforward and feedback) Additive White Gaussian Noise (AWGN) channels, and limited by individual power constraints. The first terminal would like to reliably send information to…

Information Theory · Computer Science 2015-04-16 Assaf Ben-Yishai , Ofer Shayevitz

We consider a real-valued additive channel with an individual unknown noise sequence. We present a simple sequential communication scheme based on the celebrated Schalkwijk-Kailath scheme, which varies the transmit power according to the…

Information Theory · Computer Science 2009-08-20 Yuval Lomnitz , Meir Feder

This paper studies secrecy-capacity of an $n$-dimensional Gaussian wiretap channel under a peak-power constraint. This work determines the largest peak-power constraint $\bar{\mathsf{R}}_n$ such that an input distribution uniformly…

Information Theory · Computer Science 2023-05-17 Antonino Favano , Luca Barletta , Alex Dytso

This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points.…

Information Theory · Computer Science 2021-09-06 Luca Barletta , Alex Dytso

We present simple coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted feedback. More specifically, we consider a framework…

Information Theory · Computer Science 2007-07-13 Nuno C Martins , Tsachy Weissman

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…

Information Theory · Computer Science 2015-09-16 Lingxiang Li , Zhi Chen , Jun Fang , and Athina P. Petropulu

We consider a Gaussian MISO wiretap channel, where a multi-antenna source communicates with a single-antenna destination in the presence of a single-antenna eavesdropper. The communication is assisted by multi-antenna helpers that act as…

Information Theory · Computer Science 2012-09-20 Shuangyu Luo , Jiangyuan Li , Athina Petropulu

Incorporating the physical layer characteristics to secure communications has received considerable attention in recent years. Moreover, cooperation with some nodes of network can give benefits of multiple-antenna systems, increasing the…

Information Theory · Computer Science 2013-01-10 Meysam Mirzaee , Soroush Akhlaghi

Consider a pair of terminals connected by two independent additive white Gaussian noise channels, and limited by individual power constraints. The first terminal would like to reliably send information to the second terminal, within a given…

Information Theory · Computer Science 2014-12-16 Assaf Ben-Yishai , Ofer Shayevitz

In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external…

Information Theory · Computer Science 2009-03-19 Ersen Ekrem , Sennur Ulukus

We consider the General Gaussian Multiple Access Wire-Tap Channel (GGMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed eavesdropper. We define two suitable secrecy…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener
‹ Prev 1 2 3 10 Next ›