English
Related papers

Related papers: Characterization of Rate Region in Interference Ch…

200 papers

Provable lower bounds are presented for the information rate I(X; X+S+N) where X is the symbol drawn from a fixed, finite-size alphabet, S a discrete-valued random variable (RV) and N a Gaussian RV. The information rate I(X; X+S+N) serves…

Information Theory · Computer Science 2011-10-04 Seongwook Jeong , Jaekyun Moon

We derive a single-letter formula for the zero-rate reliability (error exponent) of a finite-state channel whose state variable depends deterministically (and recursively) on past channel inputs, where the code complies with a given channel…

Information Theory · Computer Science 2016-11-15 Neri Merhav

So-called improper complex signals have been shown to be beneficial in the single-antenna two-user Gaussian interference channel under the assumptions that all input signals are Gaussian and that we treat interference as noise (TIN). This…

Information Theory · Computer Science 2020-02-06 Christoph Hellings , Wolfgang Utschick

We study the Han-Kobayashi (HK) achievable sum rate for the two-user symmetric Gaussian interference channel. We find the optimal power split ratio between the common and private messages (assuming no time-sharing), and derive a closed form…

Information Theory · Computer Science 2010-10-13 Omar Mehanna , John Marcos , Nihar Jindal

In a multi-access channel, completion time refers to the number of channel uses required for users, each with some given fixed bit pool, to complete the transmission of all their data bits. In this paper, the characterization of the…

Information Theory · Computer Science 2011-09-27 Yuanpeng Liu , Elza Erkip

We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the "data-processing bound," is the simplest and…

Quantum Physics · Physics 2018-06-18 Kunal Sharma , Mark M. Wilde , Sushovit Adhikari , Masahiro Takeoka

We find the maximum rate achievable in the private communication over a bosonic quantum channel with a fully Gaussian protocol based on optimal single-mode Gaussian measurements. This rate establishes a lower bound on the secret rate…

Quantum Physics · Physics 2025-12-18 Giuseppe Ortolano , Stefano Pirandola , Leonardo Banchi

In this paper we analyze the interference channel as a conflict situation. This viewpoint implies that certain points in the rate region are unreasonable to one of the players. Therefore these points cannot be considered achievable based on…

Information Theory · Computer Science 2007-07-13 Amir Leshem , Ephraim Zehavi

This paper studies the capacity region of a $K$-user cyclic Gaussian interference channel, where the $k$th user interferes with only the $(k-1)$th user (mod $K$) in the network. Inspired by the work of Etkin, Tse and Wang, who derived a…

Information Theory · Computer Science 2012-09-03 Lei Zhou , Wei Yu

This paper investigates the achievability of the interference channel coding. It is clarified that the rate-splitting technique is unnecessary to achieve Han-Kobayashi and Jian-Xin-Garg inner regions. Codes are constructed by using sparse…

Information Theory · Computer Science 2022-08-26 Jun Muramatsu

In this paper we consider the achievable rate region of the Gaussian Multiple Access Channel (MAC) when suboptimal transmission schemes are employed. Focusing on the two-user MAC and assuming uncoded Pulse Amplitude Modulation (PAM), we…

Information Theory · Computer Science 2011-02-25 Rizwan Ghaffar , Dimitris Toumpakaris , Jungwon Lee

The N+1 user, 1 x N single input multiple output (SIMO) Gaussian interference channel where each transmitter has a single antenna and each receiver has N antennas is studied. The symmetric capacity within O(1) is characterized for the…

Information Theory · Computer Science 2009-05-13 Tiangao Gou , Syed A. Jafar

A simple encoding scheme based on Sato's non-na\"ive frequency division is proposed for a class of Gaussian interference channels with mixed interference. The achievable region is shown to be equivalent to that of Costa's noiseberg region…

Information Theory · Computer Science 2012-07-16 Yu Zhao , Fangfang Zhu , Biao Chen

We study a class of $K$-encoder hypothesis testing against conditional independence problems. Under the criterion that stipulates minimization of the Type II error subject to a (constant) upper bound $\epsilon$ on the Type I error, we…

Information Theory · Computer Science 2022-07-05 Abdellatif Zaidi

We establish a new outer bound for the capacity region of product broadcast channels. This outer bound matches Marton's inner bound for a variety of classes of product broadcast channels whose capacity regions were previously unknown. These…

Information Theory · Computer Science 2026-04-01 Yanlin Geng , Amin Gohari , Chandra Nair , Yuanming Yu

In this work, novel upper and lower bounds for the capacity of channels with arbitrary constraints on the support of the channel input symbols are derived. As an immediate practical application, the case of multiple-input multiple-output…

Information Theory · Computer Science 2017-09-01 Alex Dytso , Mario Goldenbaum , Shlomo Shamai , H. Vincent Poor

In this paper, the capacity region of the linear deterministic interference channel with noisy channel-output feedback (LD-IC-NF) is fully characterized. The proof of achievability is based on random coding arguments and rate splitting;…

Information Theory · Computer Science 2018-05-22 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

The "water-filling" solution for the quadratic rate-distortion function of a stationary Gaussian source is given in terms of its power spectrum. This formula naturally lends itself to a frequency domain "test-channel" realization. We…

Information Theory · Computer Science 2008-02-18 Ram Zamir , Yuval Kochman , Uri Erez

In multi user Gaussian relay networks, it is desirable to transmit private information to each user as well as common information to all of them. However, the capacity region of such networks with both kinds of information is not easy to…

Information Theory · Computer Science 2018-01-16 Mohamed S. Ibrahim , Mohammed Nafie , Yahya Mohasseb

Achievable rate regions and outer bounds are derived for three-user interference channels where the transmitters cooperate in a unidirectional manner via a noncausal message-sharing mechanism. The three-user channel facilitates different…

Information Theory · Computer Science 2016-11-17 K. G. Nagananda , Parthajit Mohapatra , Chandra R. Murthy , Shalinee Kishore