English
Related papers

Related papers: Capacity and coding for the Ising Channel with Fee…

200 papers

The identification (ID) capacity region of the two-receiver broadcast channel (BC) is shown to be the set of rate-pairs for which, for some distribution on the channel input, each receiver's ID rate does not exceed the mutual information…

Information Theory · Computer Science 2017-06-02 Annina Bracher , Amos Lapidoth

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

Information Theory · Computer Science 2018-03-21 David Elkouss , David Pérez-García

In this paper, we study the effect of feedback on two-user MIMO interference channels. The capacity region of MIMO interference channels with feedback is characterized within a constant number of bits, where this constant is independent of…

Information Theory · Computer Science 2014-07-15 Mehdi Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

Information Theory · Computer Science 2007-07-13 Pierre Moulin , Ying Wang

In this work we study the capacity of interference-limited channels with memory. These channels model non-orthogonal communications scenarios, such as the non-orthogonal multiple access (NOMA) scenario and underlay cognitive communications,…

Information Theory · Computer Science 2023-06-02 Ron Dabora , Emeka Abakasanga

The fundamental limits of channels with mismatched decoding are addressed. A general formula is established for the mismatch capacity of a general channel, defined as a sequence of conditional distributions with a general decoding metrics…

Information Theory · Computer Science 2013-10-01 Anelia Somekh-Baruch

Classically, communication systems are designed assuming perfect channel state information at the receiver and/or transmitter. However, in many practical situations, only an estimate of the channel is available that differs from the true…

Information Theory · Computer Science 2007-07-13 Pablo Piantanida , Gerald Matz , Pierre Duhamel

We study finite alphabet channels with Unit Memory on the previous Channel Outputs called UMCO channels. We identify necessary and sufficient conditions, to test whether the capacity achieving channel input distributions with feedback are…

Information Theory · Computer Science 2017-01-05 Christos K. Kourtellaris , Charalambos D. Charalambous , Ioannis Tzortzis

The capacity region of the interference channel in which one transmitter non-causally knows the message of the other, termed the cognitive interference channel, has remained open since its inception in 2005. A number of subtly differing…

Information Theory · Computer Science 2015-03-13 Stefano Rini , Daniela Tuninetti , Natasha Devroye

DNA storage has emerged as a promising solution for large-scale and long-term data preservation. Among various error types, insertions are the most frequent errors occurring in DNA sequences, where the inserted symbol is often identical or…

Information Theory · Computer Science 2026-04-07 Hengfeng Liu , Chunming Tang , Cuiling Fan

The one-bit deletion and duplication channel is investigated. An input to this channel consists of a block of bits which experiences either a deletion, or a duplication, or remains unchanged. For this channel a capacity expression is…

Information Theory · Computer Science 2012-10-10 Hamed Mirghasemi , Aslan Tchamkerten

The InterFerence Channel with a Cognitive Relay (IFC-CR) consists of the classical interference channel with two independent source-destination pairs whose communication is aided by an additional node, referred to as the cognitive relay,…

Information Theory · Computer Science 2011-07-25 Stefano Rini , Daniela Tuninetti , Natasha Devroye , Andrea Goldsmith

A new inner bound on the capacity region of a general index coding problem is established. Unlike most existing bounds that are based on graph theoretic or algebraic tools, the bound is built on a random coding scheme and optimal decoding,…

Information Theory · Computer Science 2016-11-15 Fatemeh Arbabjolfaei , Bernd Bandemer , Young-Han Kim , Eren Sasoglu , Lele Wang

There are now several works on the use of the additive inverse Gaussian noise (AIGN) model for the random transit time in molecular communication~(MC) channels. The randomness invariably causes inter-symbol interference (ISI) in MC, an…

Information Theory · Computer Science 2015-09-01 Siavash Ghavami , Raviraj Adve , Farshad Lahouti

The paper provides a new perspective on peak- and average-constrained Gaussian channels. Such channels model optical wireless communication (OWC) systems which employ intensity-modulation with direct detection (IM/DD). First, the paper…

Information Theory · Computer Science 2023-03-20 Sarah Bahanshal , Ahmad Abdel-Qader , Anas Chaaban

In this paper, we investigate effective capacity by modeling a cognitive radio broadcast channel with one secondary transmitter (ST) and two secondary receivers (SRs) under quality-of-service constraints and interference power limitations.…

Information Theory · Computer Science 2016-11-17 Marwan Hammouda , Sami Akin , Jürgen Peissig

The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boost the reliability of communication. A strategy with fixed…

Information Theory · Computer Science 2016-11-17 Krishnan Eswaran , Anand D. Sarwate , Anant Sahai , Michael Gastpar

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

Information Theory · Computer Science 2015-03-18 Sanjay Karmakar , Mahesh K. Varanasi

Quantum capacity gives the fundamental limit of information transmission through a channel. However, evaluating the quantum capacities of a continuous-variable bosonic quantum channel, as well as finding an optimal code to achieve the…

Quantum Physics · Physics 2025-10-03 Adam Taylor , Michael Hanks , Hyukjoon Kwon , M. S. Kim

The non-signaling (NS) assisted capacity of a classical channel with causal channel state information at the transmitter (CSIT) is shown to be $C^{NS,ca}=\max_{P_{X|S}}I(X;Y\mid S)$, where $X, Y, S$ correspond to the input, output and state…

Information Theory · Computer Science 2026-02-13 Yuhang Yao , Syed A. Jafar