English
Related papers

Related papers: Secure Joint Source-Channel Coding for the AWGN Ch…

200 papers

We find the secrecy capacity of the 2-2-1 Gaussian MIMO wire-tap channel, which consists of a transmitter and a receiver with two antennas each, and an eavesdropper with a single antenna. We determine the secrecy capacity of this channel by…

Information Theory · Computer Science 2016-11-17 Shabnam Shafiee , Nan Liu , Sennur Ulukus

In this report, we study communication over an additive white Gaussian noise channel with a fixed signal constellation. We measure how much information we can send through this channel and how to improve the rate of communication by…

Information Theory · Computer Science 2023-02-17 Sébastien Delsad

We give a complete characterization of the correlated random coding secrecy capacity of arbitrarily varying wiretap channels (AVWCs). We apply two alternative strong secrecy criteria, which both lead to the same multi-letter formula. The…

Information Theory · Computer Science 2016-11-17 Moritz Wiese , Janis Nötzel , Holger Boche

In many communication scenarios, the communication signals simultaneously suffer from white Gaussian noise (WGN) and non-Gaussian impulsive noise (IN), i.e., mixed Gaussian-impulsive noise (MGIN). Under MGIN channel, classical communication…

Signal Processing · Electrical Eng. & Systems 2023-01-20 Chengjie Zhao , Jun Wang , Wei Huang , Xiaonan Chen , Tianfu Qi

The dependency between the Gaussianity of the input distribution for the additive white Gaussian noise (AWGN) channel and the gap-to-capacity is discussed. We show that a set of particular approximations to the Maxwell-Boltzmann (MB)…

Signal Processing · Electrical Eng. & Systems 2019-12-02 Yunus Can Gültekin , W. J. van Houtum , Arie Koppelaar , Frans M. J. Willems

One key metric for physical layer security is the secrecy capacity. This is the maximum rate that a system can transmit with perfect secrecy. For a Multiple Input Multiple Output (MIMO) system (a newer technology for 5G, 6G and beyond) the…

Information Theory · Computer Science 2022-10-03 Jennifer Chakravarty , Oliver Johnson , Robert Piechocki

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

The Unshared Secret Key Cryptography (USK), recently proposed by the authors, guarantees Shannon's ideal secrecy and perfect secrecy for MIMO wiretap channels, without requiring secret key exchange. However, the requirement of infinite…

Cryptography and Security · Computer Science 2014-11-11 Shuiyin Liu , Yi Hong , Emanuele Viterbo

We consider a group of $m$ trusted and authenticated nodes that aim to create a shared secret key $K$ over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel…

Cryptography and Security · Computer Science 2016-04-11 Mahdi Jafari Siavoshani , Shaunak Mishra , Christina Fragouli , Suhas N. Diggavi

In this paper, we investigate the problem of transmitting an analog source to a destination over $N$ uses of an additive-white-Gaussian-noise (AWGN) channel, where $N$ is very small (in the order of 10 or even less). The proposed coding…

Information Theory · Computer Science 2024-02-01 Mohammad Ali Maddah-Ali , Soheil Mohajer

Strong secrecy capacity of compound wiretap channels is studied. The known lower bounds for the secrecy capacity of compound finite-state memoryless channels under discrete alphabets are extended to arbitrary uncertainty sets and continuous…

Information Theory · Computer Science 2015-09-09 Rafael F. Schaefer , Sergey Loyka

The secrecy capacity of a discrete memoryless Gaussian Wire-Tap Channel when the input is from a finite complex constellation is studied. It is shown that the secrecy capacity curves of a finite constellation plotted against the SNR, for a…

Information Theory · Computer Science 2010-10-07 G. D. Raghava , B. Sundar Rajan

The L-user additive white Gaussian noise multiway relay channel is investigated, where L users exchange information at the same rate through a single relay. A new achievable rate region, based on the functional-decode-forward coding…

Information Theory · Computer Science 2012-09-10 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

Finite-length codes are learned for the Gaussian wiretap channel in an end-to-end manner assuming that the communication parties are equipped with deep neural networks (DNNs), and communicate through binary phase-shift keying (BPSK)…

Machine Learning · Computer Science 2020-03-25 Alireza Nooraiepour , Sina Rezaei Aghdam

We extend previous results on covert communication over the additive white Gaussian noise channel to two other types of additive noise channels. The first is the Gaussian channel with memory, where the noise sequence is a Gaussian vector…

Information Theory · Computer Science 2023-03-22 Cécile Bouette , Laura Luzzi , Ligong Wang

The feedback capacity of the stationary Gaussian additive noise channel has been open, except for the case where the noise is white. Here we find the feedback capacity of the stationary first-order moving average additive Gaussian noise…

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

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

We consider an additive Gaussian channel with additive Gaussian noise feedback. We derive an upper bound on the n-block capacity (defined by Cover [1]). It is shown that this upper bound can be obtained by solving a convex optimization…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

While the impact of finite-rate feedback on the capacity of fading channels has been extensively studied in the literature, not much attention has been paid to this problem under secrecy constraint. In this work, we study the ergodic secret…

Information Theory · Computer Science 2014-11-07 Shuiyin Liu , Yi Hong , Emanuele Viterbo

We consider a complex Gaussian wiretap channel with finite-resolution analog-to-digital converters (ADCs) at both the legitimate receiver and the eavesdropper. For this channel, we show that a positive secrecy rate is always achievable as…

Information Theory · Computer Science 2020-06-02 Seung-Hyun Nam , Si-Hyeon Lee