English
Related papers

Related papers: Adding a Helper Can Totally Remove the Secrecy Con…

200 papers

The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network,…

Information Theory · Computer Science 2012-04-16 Daniela Tuninetti

The Gaussian $K$-user interference and $M\times K$ X channels are investigated with no instantaneous channel state information (CSI) at transmitters. First, it is assumed that the CSI is fed back to all nodes after a finite delay (delayed…

Information Theory · Computer Science 2016-11-17 Mohammad Javad Abdoli , Akbar Ghasemi , Amir Keyvan Khandani

The interference channel with common information (IC-CI) consists of two transmit-receive pairs that communicate over a common noisy medium. Each transmitter has an individual message for its paired receiver, and additionally, both…

Information Theory · Computer Science 2012-03-01 Chinmay S. Vaze , Mahesh K. Varanasi

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of…

Information Theory · Computer Science 2016-04-01 Mohamed Amir , Tamer Khattab , Tarek Elfouly , Amr Mohamed

In this paper, the sum secure degrees of freedom (SDoF) of the $K$-user Multiple Input/Single Output (MISO) Broadcast Channel with Confidential Messages (BCCM) and alternating Channel State Information at the Transmitter (CSIT) is…

Information Theory · Computer Science 2020-11-24 Leyla Sadighi , Sadaf Salehkalaibar , Stefano Rini

The problem of transmitting a parameter value over an additive white Gaussian noise (AWGN) channel is considered, where, in addition to the transmitter and the receiver, there is a helper that observes the noise non-causally and provides a…

Information Theory · Computer Science 2024-10-28 Anatoly Khina , Neri Merhav

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

We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful information. We derive the power control and artificial…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Jianhua Mo , Meixia Tao

Recent works on MIMO interference channels have shown that interference alignment can significantly increase the achievable degrees of freedom (DoF) of the network. However, most of these works have assumed a fully connected interference…

Information Theory · Computer Science 2016-08-24 Liangzhong Ruan , Vincent K. N. Lau

We introduce the two-way Gaussian interference channel in which there are four nodes with four independent messages: two-messages to be transmitted over a Gaussian interference channel in the $\rightarrow$ direction, simultaneously with…

Information Theory · Computer Science 2012-10-09 Zhiyu Cheng , Natasha Devroye

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

In this work, we explore the potential and optimal use of transmitter cooperation in wireless interference networks with deep fading conditions. We consider a linear interference network with K transmitter-receiver pairs, where each…

Information Theory · Computer Science 2017-12-11 Yasemin Karacora , Tolunay Seyfi , Aly El Gamal

We study the Gaussian MIMO wiretap channel with a transmitter, a legitimate receiver, an eavesdropper and an external helper, each equipped with multiple antennas. The transmitter sends confidential messages to its intended receiver, while…

Information Theory · Computer Science 2015-05-27 S. Ali. A. Fakoorian , A. Lee Swindlehurst

This paper considers a $K$-cell multiple access channel with inter-symbol interference. The primary finding of this paper is that, without instantaneous channel state information at the transmitters (CSIT), the sum degrees-of-freedom (DoF)…

Information Theory · Computer Science 2017-04-11 Yo-Seb Jeon , Namyoon Lee , Ravi Tandon

Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations of wireless interference channels (IC) and broadcast channels (BC) under the assumption of finite precision channel state information at…

Information Theory · Computer Science 2019-10-28 Yao-Chia Chan , Junge Wang , Syed A. Jafar

We study the sum degrees of freedom (DoF) of interference channels with hybrid beam-forming in which hybrid beam-forming composed of analog and digital precodings is employed at each node. For the two-user case, we completely characterize…

Information Theory · Computer Science 2015-04-28 Sung Ho Chae , Cheol Jeong

Consider an interference channel consisting of $K_T$ transmitters and $K_R$ receivers with AWGN noise and complex channel gains, and with $N$ files in the system. The one-shot $\mathsf{DoF}$ for this channel is the maximum number of…

Information Theory · Computer Science 2019-04-11 Hari Hara Suthan Chittoor , K V Sushena Sree , Prasad Krishnan

We consider the two-hop interference channel (IC), which consists of two source-destination pairs communicating with each other via two relays. We analyze the degrees of freedom (DoF) of this network when the relays are restricted to…

Information Theory · Computer Science 2016-11-18 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr