English
Related papers

Related papers: Information Bounds and Flatness Factor Approximati…

200 papers

The performance of physical-layer security of the classic Wyner's wiretap model over Fisher-Snedecor F composite fading channels is considered in this work. Specifically, the main channel (i.e., between the source and the legitimate…

Signal Processing · Electrical Eng. & Systems 2018-05-24 Osamah S. Badarneh , Paschalis C. Sofotasios , Sami Muhaidat , Simon L. Cotton , Khaled Rabie , Naofal Al-Dhahir

This paper investigates the performance of physical layer security (PLS) in fluid antenna-aided communication systems under arbitrary correlated fading channels. In particular, it is considered that a single fixed-antenna transmitter aims…

Information Theory · Computer Science 2024-09-18 Farshad Rostami Ghadi , Kai-Kit Wong , F. Javier Lopez-Martinez , Wee Kiat New , Hao Xu , Chan-Byoung Chae

We study the fundamental limits of covert communications over general memoryless additive-noise channels. We assume that the legitimate receiver and the eavesdropper share the same channel and therefore see the same outputs. Under mild…

Information Theory · Computer Science 2024-12-24 Cécile Bouette , Laura Luzzi , Ligong Wang

An information-theoretic confidential communication is achievable if the eavesdropper has a degraded channel compared to the legitimate receiver. In wireless channels, beamforming and artificial noise can enable such confidentiality.…

Information Theory · Computer Science 2023-12-25 Stefan Roth , Aydin Sezgin

Reliable communication imposes an upper limit on the achievable rate, namely the Shannon capacity. Wyner's wiretap coding, which ensures a security constraint also, in addition to reliability, results in decrease of the achievable rate. To…

Information Theory · Computer Science 2017-02-14 Shahid M. Shah , Vinod Sharma

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main…

Information Theory · Computer Science 2016-11-17 Karim Khalil , O. Ozan Koyluoglu , Hesham El Gamal , Moustafa Youssef

We investigate the fading cognitive multiple access wiretap channel (CMAC-WT), in which two secondary-user transmitters (STs) send secure messages to a secondary-user receiver (SR) in the presence of an eavesdropper (ED) and subject to…

Signal Processing · Electrical Eng. & Systems 2020-03-31 Juening Jin , Chengshan Xiao , Meixia Tao , Wen Chen

We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we…

Information Theory · Computer Science 2019-04-10 Deekshith P K , K Gautam Shenoy , Vinod Sharma

Lattice coding for the Gaussian wiretap channel is considered, where the goal is to ensure reliable communication between two authorized parties while preventing an eavesdropper from learning the transmitted messages. Recently, a measure…

Information Theory · Computer Science 2022-02-21 Maiara F. Bollauf , Hsuan-Yin Lin , Øyvind Ytrehus

The statistical analysis of the fading End to End channel gain of the amplify and forward relaying protocol, however, is well known as extremely complex, and research work to date have only studied the asymptotic behaviour of the outage…

Information Theory · Computer Science 2016-04-22 Quoc Tuan Nguyen , D. T. Nguyen , Cong Lam Sinh

The fading wire-tap channel is investigated, where the source-to-destination channel and the source-to-wire-tapper channel are corrupted by multiplicative fading gain coefficients in addition to additive Gaussian noise terms. The channel…

Information Theory · Computer Science 2007-08-22 Yingbin Liang , H. Vincent Poor

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good…

Information Theory · Computer Science 2017-12-27 Ling Liu , Yanfei Yan , Cong Ling

In this letter, some applications of wireless communication systems over $\alpha-\eta-\kappa-\mu$ fading channels are analysed. More specifically, the effective rate and the average of both the detection probability and area under the…

Information Theory · Computer Science 2019-09-17 Hussien Al-Hmood , H. S. Al-Raweshidy

In this paper, we propose a polar coding scheme for secure communication over the multiple-input, single-output, single-antenna eavesdropper (MISOSE) fading channel. We consider the case of block fading channels with known eavesdropper…

Information Theory · Computer Science 2014-11-11 Mengfan Zheng , Meixia Tao , Wen Chen

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

Number Theory · Mathematics 2013-04-17 Fuchun Lin , Frédérique Oggier , Patrick Solé

In a recent paper, the authors introduced a lattice invariant called "Secrecy Gain" which measures the confusion experienced by a passive eavesdropper on the Gaussian Wiretap Channel. We study, here, the behavior of this invariant for…

Information Theory · Computer Science 2010-07-06 Jean-Claude Belfiore , Patrick Sole

In this paper, we investigate the design of artificial-noise-aided secure multi-antenna transmission in slow fading channels. The primary design concerns include the transmit power allocation and the rate parameters of the wiretap code. We…

Information Theory · Computer Science 2016-11-17 Xi Zhang , Xiangyun Zhou , Matthew R. McKay

A covert communication system under block fading channels is considered where users experience uncertainty about their channel knowledge. The transmitter seeks to hide the covert communication to a private user by exploiting a legitimate…

Information Theory · Computer Science 2017-03-08 Khurram Shahzad , Xiangyun Zhou , Shihao Yan

We study the error probability performance of rotated lattice constellations in frequency-flat Nakagami-$m$ block-fading channels. In particular, we use the sphere lower bound on the underlying infinite lattice as a performance benchmark.…

Information Theory · Computer Science 2007-07-13 Albert Guillen i Fabregas , Emanuele Viterbo

We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and temporal memory. The fading number is the second term, after…

Information Theory · Computer Science 2007-07-16 Stefan M. Moser