English
Related papers

Related papers: Polar Lattices for Strong Secrecy Over the Mod-$\L…

200 papers

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have…

Information Theory · Computer Science 2011-10-11 Anusha Gorantla , Vinod Sharma

This paper studies a scalar Gaussian wiretap channel where instead of an average input power constraint, we consider a peak amplitude constraint on the input. The goal is to obtain insights into the secrecy-capacity and the structure of the…

Information Theory · Computer Science 2021-11-24 Luca Barletta , Alex Dytso

Providing security guarantees for wireless communication is critically important for today's applications. While previous work in this area has concentrated on radio frequency (RF) channels, providing security guarantees for RF channels is…

Information Theory · Computer Science 2015-03-13 Amine Laourine , Aaron B. Wagner

In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which…

Information Theory · Computer Science 2016-08-02 Amaro Barreal , Alex Karrila , David Karpuk , Camilla Hollanti

Due to the broadcast nature of the wireless medium, wireless communication is susceptible to adversarial eavesdropping. This paper describes how eavesdropping can potentially be defeated by exploiting the superposition nature of the…

Information Theory · Computer Science 2008-05-02 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

The coding problem for wiretap channels with causal channel state information available at the encoder and/or the decoder is studied under the strong secrecy criterion. This problem consists of two aspects: one is due to naive wiretap…

Information Theory · Computer Science 2019-07-30 Te Sun Han , Masahide Sasaki

A polar decomposition of mutual information between a complex-valued channel's input and output is proposed for a input whose amplitude and phase are independent of each other. The mutual information is symmetrically decomposed into three…

Information Theory · Computer Science 2013-04-02 Qiuliang Xie , Zhaocheng Wang , Zhixing Yang

This work investigates the effect of finite-alphabet source input on the secrecy rate of a multi-antenna wiretap system. Existing works have characterized maximum achievable secrecy rate or secrecy capacity for single and multiple antenna…

Information Theory · Computer Science 2016-11-15 Shafi Bashar , Zhi Ding , Chengshan Xiao

The use of open-loop coding can be easily extended to a closed-loop concatenated code if the channel has access to feedback. This can be done by introducing a feedback transmission scheme as an inner code. In this paper, this process is…

Information Theory · Computer Science 2011-02-23 Zachary Chance , David J. Love

A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar…

Information Theory · Computer Science 2013-02-04 Hessam Mahdavifar , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…

Information Theory · Computer Science 2013-04-19 Camilla Hollanti , Emanuele Viterbo , David Karpuk

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…

Information Theory · Computer Science 2013-04-11 Ido Tal , Alexander Vardy

This work presents a polar coding scheme for fading channels, focusing primarily on fading binary symmetric and additive exponential noise channels. For fading binary symmetric channels, a hierarchical coding scheme is presented, utilizing…

Information Theory · Computer Science 2014-08-19 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

The self-consistent GW band gaps are known to be significantly overestimated. We show that this overestimation is, to a large extent, due to the neglect of the contribution of the lattice polarization to the screening of the…

Materials Science · Physics 2015-06-15 Silvana Botti , Miguel A. L. Marques

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

For the additive Gaussian noise channel with average codeword power constraint, sparse superposition codes and adaptive successive decoding is developed. Codewords are linear combinations of subsets of vectors, with the message indexed by…

Information Theory · Computer Science 2010-06-22 Andrew R Barron , Antony Joseph

Optimal signalling over the Gaussian MIMO wire-tap channel is studied under the total transmit power constraint. A closed-form solution for an optimal transmit covariance matrix is obtained when the channel is strictly degraded. In…

Information Theory · Computer Science 2016-11-02 Sergey Loyka , Charalambos D. Charalambous

Tailoring polar code construction for decoding algorithms beyond successive cancellation has remained a topic of significant interest in the field. However, despite the inherent nested structure of polar codes, the use of sequence models in…

Information Theory · Computer Science 2024-01-31 Sravan Kumar Ankireddy , S Ashwin Hebbar , Heping Wan , Joonyoung Cho , Charlie Zhang

This paper is concerned with the general multiple access wiretap channel and the existence of codes that accomplish reliability and strong secrecy. Information leakage to the eavesdropper is assessed by the variational distance metric,…

Information Theory · Computer Science 2020-03-10 Manos Athanasakos , Nicholas Kalouptsidis

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos
‹ Prev 1 8 9 10 Next ›