English
Related papers

Related papers: Secrecy in the 2-User Symmetric Deterministic Inte…

200 papers

Relays in cellular systems are interference limited. The highest end-to-end sum rates are achieved when the relays are jointly optimized with the transmit strategy. Unfortunately, interference couples the links together making joint…

Information Theory · Computer Science 2015-03-20 Kien T. Truong , Robert W. Heath

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

It is shown that a receiver equipped with two antennas may null an arbitrary large number of spatial directions to any desired accuracy, while maintaining the interference-free signal-to-noise ratio, by judiciously adjusting the distance…

Information Theory · Computer Science 2019-05-31 Amir Leshem , Uri Erez

In this paper we present a multi-user cooperative protocol for wireless networks. Two sources transmit simultaneously their information blocks and relays employ opportunistically successive interference cancellation (SIC) in an effort to…

Networking and Internet Architecture · Computer Science 2016-11-17 Antonios Argyriou

We consider collocated primary and secondary networks that have simultaneous access to the same frequency bands. Particularly, we examine three different levels at which primary and secondary networks may coexist: pure interference,…

Information Theory · Computer Science 2016-11-17 Nadia Jamal , Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

We characterize the generalized degrees of freedom of the $K$ user symmetric Gaussian interference channel where all desired links have the same signal-to-noise ratio (SNR) and all undesired links carrying interference have the same…

Information Theory · Computer Science 2012-04-03 Syed A. Jafar , Sriram Vishwanath

An inner bound to the capacity region of a class of deterministic interference channels with three user pairs is presented. The key idea is to simultaneously decode the combined interference signal and the intended message at each receiver.…

Information Theory · Computer Science 2015-03-13 Bernd Bandemer , Abbas El Gamal

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

The constantly increasing demand for interactive broadband satellite communications is driving current research to explore novel system architectures that reuse frequency in a more aggressive manner. To this end, the topic of dual satellite…

Information Theory · Computer Science 2012-11-27 Dimitrios Christopoulos , Symeon Chatzinotas , Bjorn Ottersten

In this paper, we propose a new cooperation model for discrete memoryless multiple access channels. Unlike in prior cooperation models (e.g., conferencing encoders), where the transmitters cooperate directly, in this model the transmitters…

Information Theory · Computer Science 2014-04-29 Parham Noorzad , Michelle Effros , Michael Langberg , Tracey Ho

The 2-receiver broadcast channel is studied: a network with three parties where the transmitter and one of the receivers are the primarily involved parties and the other receiver considered as third party. The messages that are determined…

Information Theory · Computer Science 2019-03-12 Farzin Salek , Min-Hsiu Hsieh , Javier R. Fonollosa

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from…

Information Theory · Computer Science 2020-05-29 Hongchao Zhou , Abbas El Gamal

In this paper, we consider the coded-caching broadcast network with user cooperation, where a server connects with multiple users and the users can cooperate with each other through a cooperation network. We propose a centralized coded…

Information Theory · Computer Science 2019-04-12 Jiahui Chen , Haoyu Yin , Xiaowen You , Yanlin Geng , Youlong Wu

A novel class of achievable rate regions is obtained for the K-receiver broadcast channel with two groupcast messages. The associated achievability schemes are parameterized by an expansion of the message set which then determines how…

Information Theory · Computer Science 2020-01-28 Mohamed Salman , Mahesh K. Varanasi

Considering a multi-user interference network with an eavesdropper, this paper aims at the power allocation to optimize the worst secrecy throughput among the network links or the secure energy efficiency in terms of achieved secrecy…

Information Theory · Computer Science 2017-08-25 Zhichao Sheng , Hoang Duong Tuan , Ali Arshad Nasir , Trung Q. Duong , H. Vincent Poor

In this paper, we consider the design of a new secrecy transmission scheme for a four-node relay-eavesdropper channel. The key idea of the proposed scheme is to combine noisy network coding with the interference assisted strategy for…

Information Theory · Computer Science 2012-08-27 Peng Xu , Zhiguo Ding , and Xuchu Dai , Kin Leung

This paper studies the K-user Gaussian interference channel with secrecy constraints. Two distinct network models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. Using…

Information Theory · Computer Science 2016-11-15 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor

This paper proposes an interference alignment method with distributed and delayed channel state information at the transmitter (CSIT) for a class of interference networks. The core idea of the proposed method is to align interference…

Information Theory · Computer Science 2016-11-17 Namyoon Lee , Ravi Tandon , Robert W. Heath

While interference alignment schemes have been employed to realize the full multiplexing gain of $K$-user interference channels, the analyses performed so far have predominantly focused on the case when global channel knowledge is available…

Information Theory · Computer Science 2009-12-01 Rajesh T Krishnamachari , Mahesh K Varanasi

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck
‹ Prev 1 4 5 6 7 8 10 Next ›