English
Related papers

Related papers: The Gaussian Many-to-One Interference Channel with…

200 papers

We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable…

Information Theory · Computer Science 2008-11-11 E. Ekrem , S. Ulukus

We characterize the symmetric capacity to within 1.7075 bits/s/Hz for the two-user Gaussian interference channel with feedback. The result makes use of a deterministic model to provide insights into the Gaussian channel. We derive a new…

Information Theory · Computer Science 2009-01-26 Changho Suh , David Tse

This paper presents two new results on multiple-input multiple-output (MIMO) Gaussian broadcast channels with confidential messages. First, the problem of the MIMO Gaussian wiretap channel is revisited. A matrix characterization of the…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Tie Liu , H. Vincent Poor , Shlomo Shamai

We provide innerbound and outerbound for the total number of degrees of freedom of the $K$ user multiple input multiple output (MIMO) Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver if…

Information Theory · Computer Science 2008-09-02 Tiangao Gou , Syed A. Jafar

This paper studies a family of genie-MAC (multiple access channel) outer bounds for K-user Gaussian interference channels. This family is inspired by existing genie-aided bounding mechanisms, but differs from current approaches in its…

Information Theory · Computer Science 2015-03-14 Jubin Jose , Sriram Vishwanath

We study the problem of maximizing sum rates in a Gaussian interference-limited channel that models multiuser communication in a CDMA wireless network or DSL cable binder. Using tools from nonnegative irreducible matrix theory, in…

Optimization and Control · Mathematics 2008-07-07 Shmuel Friedland , Chee Wei Tan

We study a deterministic approximation of the two-user multiple access wiretap channel. This approximation enables results beyond the recently shown $\tfrac{2}{3}$ secure degrees of freedom (s.d.o.f.) for the Gaussian multiple access…

Information Theory · Computer Science 2017-01-26 Rick Fritschek , Gerhard Wunder

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2008-04-29 Ruoheng Liu , H. Vincent Poor

We study the capacity of secret-key agreement over a wiretap channel with state parameters. The transmitter communicates to the legitimate receiver and the eavesdropper over a discrete memoryless wiretap channel with a memoryless state…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

This paper studies the achievable rate region of the two-user single-input-single-output (SISO) Gaussian interference channel, when the improper Gaussian signaling is applied. Under the assumption that the interference is treated as…

Information Theory · Computer Science 2012-05-10 Yong Zeng , Cenk M. Yetis , Erry Gunawan , Yong Liang Guan , Rui Zhang

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2007-10-01 Ruoheng Liu , H. Vincent Poor

This paper considers the problem of the multiple-input multiple-output (MIMO) Gaussian broadcast channel with two receivers (receivers 1 and 2) and two messages: a common message intended for both receivers and a confidential message…

Information Theory · Computer Science 2016-11-17 Hung D. Ly , Tie Liu , Yingbin Liang

A discrete memoryless generalized multiple access channel (GMAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , H. Vincent Poor

Using Gaussian inputs and treating interference as noise at the receivers has recently been shown to be sum capacity achieving for the two-user single-input single-output (SISO) Gaussian interference channel in a low interference regime,…

Information Theory · Computer Science 2010-10-25 V. Sreekanth Annapureddy , Venugopal V. Veeravalli

The paper studies a class of three user Gaussian interference channels. A new layered lattice coding scheme is introduced as a transmission strategy. The use of lattice codes allows for an "alignment" of the interference observed at each…

Information Theory · Computer Science 2008-09-26 Sriram Sridharan , Amin Jafarian , Sriram Vishwanath , Syed A. Jafar , Shlomo Shamai

We introduce the two user finite state compound Gaussian interference channel and characterize its capacity region to within one bit. The main contributions involve both novel inner and outer bounds. The inner bound is multilevel…

Information Theory · Computer Science 2008-05-01 Adnan Raja , Vinod M. Prabhakaran , Pramod Viswanath

One of the key open problems in network information theory is to obtain the capacity region for the two-user Interference Channel (IC). In this paper, new results are derived for this channel. As a first result, a noisy interference regime…

Information Theory · Computer Science 2013-02-08 Reza K. Farsani

A new problem formulation is presented for the Gaussian interference channels (GIFC) with two pairs of users, which are distinguished as primary users and secondary users, respectively. The primary users employ a pair of encoder and decoder…

Information Theory · Computer Science 2016-11-17 Xiujie Huang , Xiao Ma , Lei Lin , Baoming Bai

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is…

Information Theory · Computer Science 2021-04-29 Zheng Li , Sheng Yang , Shlomo Shamai

We obtain new sum capacity results for the Gaussian many-to-one and one-to-many interference channels in channel parameter regimes where the sum capacity was known only up to a constant gap. Simple Han-Kobayashi (HK) schemes, i.e., HK…

Information Theory · Computer Science 2017-05-04 Abhiram Gnanasambandam , Ragini Chaluvadi , Srikrishna Bhashyam
‹ Prev 1 3 4 5 6 7 10 Next ›