English
Related papers

Related papers: On the Optimality of Secure Communication Without …

200 papers

We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI…

Information Theory · Computer Science 2013-02-27 Jianwei Xie , Sennur Ulukus

This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas.…

Information Theory · Computer Science 2024-07-03 Hao Xu , Kai-Kit Wong , Yinfei Xu , Giuseppe Caire

The role of cooperation in managing interference - a fundamental feature of the wireless channel - is investigated by studying the two-user Gaussian interference channel where the source nodes can both transmit and receive in full-duplex.…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

Despite the simplicity of the scheme of treating interference as noise (TIN), it was shown to be sum-capacity optimal in the Gaussian interference channel (IC) with very-weak (noisy) interference. In this paper, the 2-user IC is altered by…

Information Theory · Computer Science 2015-04-21 Soheil Gherekhloo , Chen Di , Anas Chaaban , Aydin Sezgin

In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the…

Information Theory · Computer Science 2015-10-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

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

In this paper, we develop achievability schemes for symmetric $K$-user interference channels with a rate-limited feedback from each receiver to the corresponding transmitter. We study this problem under two different channel models: the…

Information Theory · Computer Science 2017-08-04 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

The problem of jamming on multiple-input multiple-output (MIMO) Gaussian channels is investigated in this paper. In the case of a single target legitimate signal, we show that the existing result based on the simplification of the system…

Information Theory · Computer Science 2016-03-03 Jie Gao , Sergiy A. Vorobyov , Hai Jiang

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 who is as capable as the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

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

So-called improper complex signals have been shown to be beneficial in the single-antenna two-user Gaussian interference channel under the assumptions that all input signals are Gaussian and that we treat interference as noise (TIN). This…

Information Theory · Computer Science 2020-02-06 Christoph Hellings , Wolfgang Utschick

In this work, we prove that a positive secure degree of freedom is achievable for a large class of Gaussian channels as long as the channel is not degraded and the channel is fully connected. This class includes the MAC wire-tap channel,…

Information Theory · Computer Science 2016-11-17 Xiang He , Aylin Yener

In this paper, we investigate performances of simple transmission strategies. We first consider two user SISO Gaussian symmetric interference channel (IC) for which Etkin, Tse and Wang proposed a scheme (ETW scheme) which achieves one bit…

Information Theory · Computer Science 2012-05-15 Jung Hyun Bae , Jungwon Lee , Inyup Kang

Certain deterministic interference channels have been shown to accurately model Gaussian interference channels in the asymptotic low-noise regime. Motivated by this correspondence, we investigate a K user-pair, cyclically symmetric,…

Information Theory · Computer Science 2016-11-17 Bernd Bandemer , Gonzalo Vazquez-Vilar , Abbas El Gamal

In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information…

Cryptography and Security · Computer Science 2020-04-20 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

In this paper, we explore the information-theoretic optimality of treating interference as noise (TIN) in cellular networks. We focus on uplink scenarios modeled by the Gaussian interfering multiple access channel (IMAC), comprising $K$…

Information Theory · Computer Science 2019-04-25 Hamdi Joudeh , Bruno Clerckx

The Han-Kobayashi (HK) scheme achieves the best known achievable rate region for the K user interference channel (IC). Simple HK schemes are HK schemes with Gaussian signaling, no time sharing, and no private-common power splitting. The…

Information Theory · Computer Science 2020-01-08 Ragini Chaluvadi , Bolli Madhuri , Srikrishna Bhashyam

A two-user Gaussian Z-Interference Channel (GZIC) is considered, in which encoders are connected through noiseless links with finite capacities. In this setting, prior to each transmission block the encoders communicate with each other over…

Information Theory · Computer Science 2010-05-28 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

In this paper, we look at the problem of treating interference as noise (TIN) in the Gaussian interfering multiple access channel (IMAC). The considered network comprises $K$ mutually interfering multiple access channels (MACs), each…

Information Theory · Computer Science 2018-05-15 Hamdi Joudeh , Bruno Clerckx

We study the covert communication over K-user discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K "off" input symbols, which are sent when no…

Information Theory · Computer Science 2020-03-11 Kang-Hee Cho , Si-Hyeon Lee