English
Related papers

Related papers: On the Deterministic Sum-Capacity of the Multiple …

200 papers

We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2…

Information Theory · Computer Science 2018-04-24 Rick Fritschek , Gerhard Wunder

Recent investigations have shown that the sum secure degrees of freedom of the Gaussian wiretap channel with a helper is $\tfrac{1}{2}$. The achievable scheme for this result is based on the real interference alignment approach. While…

Information Theory · Computer Science 2016-09-19 Rick Fritschek , Gerhard Wunder

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix…

Information Theory · Computer Science 2012-03-08 Xiang He , Ashish Khisti , Aylin Yener

In this paper, we use the linear deterministic approximation model to study a two user multiple access channel mutually interfering with a point to point link, which represents a basic setup of a cellular system. We derive outer bounds on…

Information Theory · Computer Science 2011-05-12 Jörg Bühler , Gerhard Wunder

In this paper, a multiple antenna wire-tap channel in the presence of a multi-antenna cooperative jammer is studied. In particular, the secure degrees of freedom (s.d.o.f.) of this channel is established, with $N_t$ antennas at the…

Information Theory · Computer Science 2015-12-24 Mohamed Nafea , Aylin Yener

We consider a two-user multiple-input multiple-output (MIMO) multiple access wiretap channel with $N$ antennas at each transmitter, $N$ antennas at the legitimate receiver, and $K$ antennas at the eavesdropper. We determine the optimal sum…

Information Theory · Computer Science 2016-04-13 Pritam Mukherjee , Sennur Ulukus

A $K$-user secure Gaussian Multiple-Access-Channel (MAC) with an external eavesdropper is considered in this paper. An achievable rate region is established for the secure discrete memoryless MAC. The secrecy sum capacity of the degraded…

Information Theory · Computer Science 2010-03-04 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We revisit the recent secure degrees of freedom (s.d.o.f.) results for one-hop multi-user wireless networks by considering three fundamental wireless network structures: Gaussian wiretap channel with helpers, Gaussian multiple access…

Information Theory · Computer Science 2015-07-09 Jianwei Xie , Sennur Ulukus

We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental Gaussian network structures: wiretap channel, broadcast channel with confidential messages, interference channel with confidential…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

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

The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined…

Information Theory · Computer Science 2016-11-17 Jianwei Xie , Sennur Ulukus

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

We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user…

Information Theory · Computer Science 2013-05-31 Jianwei Xie , Sennur Ulukus

There has been major progress over the last decade in understanding the classical interference channel (IC). Recent key results show that constant bit gap capacity results can be obtained from linear deterministic models (LDMs). However, it…

Information Theory · Computer Science 2016-11-17 Rick Fritschek , Gerhard Wunder

This paper considers a scenario in which a source-destination pair needs to establish a confidential connection against an external eavesdropper, aided by the interference generated by another source-destination pair that exchanges public…

Information Theory · Computer Science 2016-12-21 Lingxiang Li , Athina P. Petropulu , Zhi Chen , Jun Fang

We study a symmetric Gaussian wiretap channel with a helper, where a confidential message is sent from a transmitter to a legitimate receiver, in the presence of a helper and an eavesdropper, under a weak notion of secrecy constraint. For…

Information Theory · Computer Science 2019-09-12 Jinyuan Chen , Chunhua Geng

The secrecy degrees of freedom (SDoF) of the Gaussian multiple-input and single-output (MISO) wiretap channel is studied under the assumption that delayed channel state information (CSI) is available at the transmitter and each receiver…

Information Theory · Computer Science 2011-08-09 Sheng Yang , Pablo Piantanida , Mari Kobayashi , Shlomo Shamai

In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the…

Information Theory · Computer Science 2017-07-20 Chao Qi , Bin Dai , Xiaohu Tang

We study the secrecy capacity of a helper-assisted Gaussian wiretap channel with a source, a legitimate receiver, an eavesdropper and an external helper, where each terminal is equipped with multiple antennas. Determining the secrecy…

Information Theory · Computer Science 2015-09-16 Lingxiang Li , Zhi Chen , Jun Fang , and Athina P. Petropulu

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 2 3 10 Next ›