English
Related papers

Related papers: Interference Channels With Arbitrarily Correlated …

200 papers

This paper considers a degraded Gaussian broadcast channel over which Gaussian sources are to be communicated. When the sources are independent, this paper shows that hybrid coding achieves the optimal distortion region, the same as that of…

Information Theory · Computer Science 2009-06-16 Rajiv Soundararajan , Sriram Vishwanath

In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of…

Information Theory · Computer Science 2010-12-01 Soheil Feizi , Muriel Medard

This paper provides a complete characterization of the boundary of an achievable rate region, called the Pareto boundary, of the single-antenna Z interference channel (Z-IC), when interference is treated as noise and users transmit complex…

Information Theory · Computer Science 2017-06-26 Christian Lameiro , Ignacio Santamaria , Peter J. Schreier

In this paper, we propose a low-complexity, secrecy capacity achieving polar coding scheme for the cognitive interference channel with confidential messages (CICC) under the strong secrecy criterion. Existing polar coding schemes for…

Information Theory · Computer Science 2017-10-30 Mengfan Zheng , Wen Chen , Cong Ling

In this paper, we propose {\em distributed network compression via memory}. We consider two spatially separated sources with correlated unknown source parameters. We wish to study the universal compression of a sequence of length $n$ from…

Information Theory · Computer Science 2012-10-09 Ahmad Beirami , Faramarz Fekri

The three-user finite field multi-way relay channel with correlated sources is considered. The three users generate possibly correlated messages, and each user is to transmit its message to the two other users reliably in the Shannon sense.…

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

The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…

Information Theory · Computer Science 2011-02-02 Moritz Wiese , Holger Boche , Igor Bjelaković , Volker Jungnickel

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

The dynamics of interference over space and time influences the performance of wireless communication systems, yet its features are still not fully understood. This article analyzes the temporal dynamics of the interference in Poisson…

Information Theory · Computer Science 2019-04-26 Udo Schilcher , Jorge F. Schmidt , Mahin K. Atiq , Christian Bettstetter

We consider a system in which two nodes take correlated measurements of a random source with time-varying and unknown statistics. The observations of the source at the first node are to be losslessly replicated with a given probability of…

Information Theory · Computer Science 2016-10-27 Fangzhou Chen , Bin Li , Can Emre Koksal

We consider the problem of communication over a network containing a hidden and malicious adversary that can control a subset of network resources, and aims to disrupt communications. We focus on omniscient node-based adversaries, i.e., the…

Information Theory · Computer Science 2016-05-09 Peida Tian , Sidharth Jaggi , Mayank Bakshi , Oliver Kosut

Achievability and converse results for the lossy transmission of correlated sources over Shannon's two-way channels (TWCs) are presented. A joint source-channel coding theorem for independent sources and TWCs for which adaptation cannot…

Information Theory · Computer Science 2018-05-08 Jian-Jia Weng , Fady Alajaji , Tamás Linder

A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a…

Information Theory · Computer Science 2012-07-10 Ruchen Duan Yingbin Liang

This work discusses the source broadcasting problem, i.e. transmitting a source to many receivers via a broadcast channel. The optimal rate-distortion region for this problem is unknown. The separation approach divides the problem into two…

Information Theory · Computer Science 2014-01-21 Uri Mendlovic , Meir Feder

We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful information. We derive the power control and artificial…

Information Theory · Computer Science 2016-11-18 Jingge Zhu , Jianhua Mo , Meixia Tao

In this work, we study the arbitrarily varying broadcast channel (AVBC), when state information is available at the transmitter in a causal manner. We establish inner and outer bounds on both the random code capacity region and the…

Information Theory · Computer Science 2017-09-19 Uzi Pereg , Yossef Steinberg

In this paper we explore the information-theoretic aspects of interference alignment and its relation to channel state information (CSI). For the $K-$user interference channel using different changing patterns between different users, we…

Information Theory · Computer Science 2015-12-08 Milad Johnny , Mohammad Reza Aref

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

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

A dealer aims to share a secret with participants so that only predefined subsets can reconstruct it, while others learn nothing. The dealer and participants access correlated randomness and communicate over a one-way, public, rate-limited…

Information Theory · Computer Science 2026-01-27 Rumia Sultana , Remi A. Chou