English
Related papers

Related papers: Secrecy Capacity over Correlated Ergodic Fading Ch…

200 papers

The ergodic capacity of underlay cognitive (secondary) dual-hop relaying systems is analytically investigated. Specifically, the amplify-and-forward transmission protocol is considered, while the received signals undergo multipath fading…

Information Theory · Computer Science 2015-09-01 Nikolaos I. Miridakis

A Gaussian multiple-input multiple-output wiretap channel in which the eavesdropper and legitimate receiver are equipped with arbitrary numbers of antennas and the transmitter has two antennas is studied in this paper. Under an average…

Information Theory · Computer Science 2017-07-21 Mojtaba Vaezi , Wonjae Shin , H. Vincent Poor

In this paper, the secrecy analysis of physical layer when both the main and wiretap channels undergo $\kappa-\mu$ shadowed fading channel is investigated. In particular, the average secrecy capacity (ASC), secure outage probability (SOP),…

Information Theory · Computer Science 2018-04-26 Hussien Al-Hmood , H. S. Al-Raweshidy

In this paper, we study the secrecy rate and outage probability in Multiple-Input-Single-Output (MISO) Gaussian wiretap channels at the limit of a large number of legitimate users and eavesdroppers. In particular, we analyze the asymptotic…

Information Theory · Computer Science 2016-05-10 Joseph Kampeas , Asaf Cohen , Omer Gurewitz

This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that…

Information Theory · Computer Science 2015-11-05 Hongbo Si , O. Ozan Koyluoglu , Sriram Vishwanath

This paper uses Euclidean Information Theory (EIT) to analyze the wiretap channel. We investigate a scenario of efficiently transmitting a small amount of information subject to compression rate and secrecy constraints. We transform the…

Information Theory · Computer Science 2024-03-21 Emmanouil M. Athanasakos , Nicholas Kalouptsidis , Hariprasad Manjunath

We propose a technique to derive upper bounds on Gallager's cost-constrained random coding exponent function. Applying this technique to the non-coherent peak-power or average-power limited discrete time memoryless Ricean fading channel, we…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Natalia Miliou

In multi-(core/mode) optical fiber communication, the transmission channel can be modeled as a complex sub-matrix of the Haar-distributed unitary matrix (complex Jacobi unitary ensemble). In this letter, we present new analytical…

Information Theory · Computer Science 2017-06-07 Amor Nafkha , Remi Bonnefoi

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical…

Information Theory · Computer Science 2014-01-16 Sanjay Vishwakarma , A. Chockalingam

This paper studies the capacity of the multi-antenna or multiple-input multiple-output (MIMO) secrecy channels with multiple eavesdroppers having single/multiple antennas. It is known that the MIMO secrecy capacity is achievable with the…

Information Theory · Computer Science 2009-02-02 Lan Zhang , Rui Zhang , Ying-Chang Liang , Yan Xin , Shuguang Cui

This paper studies adaptive coding for the two-way wiretap channel. Especially, the strong secrecy metric is of our interest that is defined by the information leakage of transmitted messages to the eavesdropper. First, we consider an…

Information Theory · Computer Science 2024-06-25 Yanling Chen , Masahito Hayashi

In this paper, the ergodic sum-rate and outage probability of a downlink single-antenna channel with K users are analyzed in the presence of Rayleigh flat fading, where limited channel state information (CSI) feedback is assumed.…

Information Theory · Computer Science 2010-01-12 Bo Niu , Osvaldo Simeone , Oren Somekh , Alexander M. Haimovich

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…

Information Theory · Computer Science 2018-10-03 Long Kong , Satyanarayana Vuppala , Georges Kaddoum

With the growth of wireless networks, security has become a fundamental issue in wireless communications due to the broadcast nature of these networks. In this work, we consider MIMO wiretap channels in a fast fading environment, for which…

Information Theory · Computer Science 2014-11-04 Maksym A. Girnyk , Frédéric Gabry , Mikko Vehkaperä , Lars K. Rasmussen , Mikael Skoglund

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any…

Information Theory · Computer Science 2013-07-10 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

Capacity gains from transmitter and receiver cooperation are compared in a relay network where the cooperating nodes are close together. Under quasi-static phase fading, when all nodes have equal average transmit power along with full…

Information Theory · Computer Science 2009-09-25 Chris T. K. Ng , Andrea J. Goldsmith

The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the…

Information Theory · Computer Science 2007-07-13 Rasika Perera , Tony Pollock , Thushara Abhayapala

Flat-fading channels that are correlated in time are considered under peak and average power constraints. For discrete-time channels, a new upper bound on the capacity per unit time is derived. A low SNR analysis of a full-scattering vector…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Bruce Hajek
‹ Prev 1 8 9 10 Next ›