English
Related papers

Related papers: Towards Scalable Security in Interference Channels…

200 papers

In this paper, we take all users' secrecy rate requirements into consideration and propose a rate-splitting multiple access (RSMA)-based secure beamforming approach to maximize the weighted sum-rate (WSR), where multi-user interference…

Information Theory · Computer Science 2023-08-25 Huiyun Xia , Yijie Mao , Xiaokang Zhou , Bruno Clerckx , Shuai Han , Cheng Li

We consider secure communication over a two-user Gaussian interference channel, where each transmitter sends a confidential message to its legitimate receiver. For this setting, we identify a regime where the simple scheme of using Gaussian…

Information Theory · Computer Science 2017-06-21 Jinyuan Chen

A new channel coding approach was proposed in [1] for random multiple access communication over the discrete-time memoryless channel. The coding approach allows users to choose their communication rates independently without sharing the…

Information Theory · Computer Science 2016-11-15 Zheng Wang , Jie Luo

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

In this paper, we propose opportunistic interference alignment (OIA) schemes for three-transmitter multiple-input multiple-output (MIMO) interference channels (ICs). In the proposed OIA, each transmitter has its own user group and selects a…

Information Theory · Computer Science 2015-03-19 Jung Hoon Lee , Wan Choi

In this paper we analyze a constant multiple-input multiple-output interference channel where a set of active users are cooperating through interference alignment while a set of secondary users desire access to the channel. We derive the…

Information Theory · Computer Science 2012-07-19 Behrang Nosrat-Makouei , Jeffrey G. Andrews , Robert W. Heath

The aim of this paper is to study the achievable rates for a $K$ user Gaussian interference channels for any SNR using a combination of lattice and algebraic codes. Lattice codes are first used to transform the Gaussian interference channel…

Information Theory · Computer Science 2011-09-27 Amin Jafarian , Sriram Vishwanath

Non-malleable codes protect against an adversary who can tamper with the coded message by using a tampering function in a specified function family, guaranteeing that the tampering result will only depend on the chosen function and not the…

Information Theory · Computer Science 2019-07-04 Fuchun Lin , San Ling , Reihaneh Safavi-Naini , Huaxiong Wang

In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the…

Information Theory · Computer Science 2020-07-14 Mengfan Zheng , Yongpeng Wu , Wenjun Zhang

Interference alignment aims to achieve maximum degrees of freedom in an interference system. For achieving Interference alignment in interfering broadcast systems a closed-form solution is proposed in [1] which is an extension of the…

Information Theory · Computer Science 2014-06-20 Gaurav Gupta , Ajit K Chaturvedi

This paper addresses a unified approach towards communication in decentralized wireless networks of separate transmitter-receiver pairs. In general, users are unaware of each other's codebooks and there is no central controller to assign…

Information Theory · Computer Science 2016-09-08 Kamyar Moshksar , Amir K. Khandani

Interference alignment has emerged as a powerful tool in the analysis of multi-user networks. Despite considerable recent progress, the capacity region of the Gaussian K-user interference channel is still unknown in general, in part due to…

Information Theory · Computer Science 2016-11-15 Or Ordentlich , Uri Erez , Bobak Nazer

An achievable rate region, based on lattice interference alignment, is derived for a class of time-invariant Gaussian interference channels with more than two users. The result is established via a new coding theorem for the two-user…

Information Theory · Computer Science 2011-06-21 Or Ordentlich , Uri Erez

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source…

Information Theory · Computer Science 2009-10-16 Xiang He , Aylin Yener

Due to the broadcast nature of wireless communications, physical layer security has always been a fundamental but challenging problem. Recent advance of Intelligent Reflecting Surface (IRS) introduces a new dimension for secure…

Signal Processing · Electrical Eng. & Systems 2020-10-29 Jian Li , Lan Zhang , Kaiping Xue , Yuguang Fang

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

Information Theory · Computer Science 2016-11-17 Viveck R. Cadambe , Syed A. Jafar

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

This paper investigates the additive white Gaussian noise two-way relay channel, where two users exchange messages through a relay. Asymmetrical channels are considered where the users can transmit data at different rates and at different…

Information Theory · Computer Science 2011-10-26 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson

As investigations on physical layer security evolve from point-to-point systems to multi-user scenarios, multi-user interference (MUI) is introduced and becomes an unavoidable issue. Different from treating MUI totally as noise in…

Information Theory · Computer Science 2022-03-07 Huiyun Xia , Yijie Mao , Bruno Clerckx , Xiaokang Zhou , Shuai Han , Cheng Li

We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding…

Information Theory · Computer Science 2013-03-06 Byungjun Kang , Si-Hyeon Lee , Sae-Young Chung , Changho Suh