English
Related papers

Related papers: The adaptive zero-error capacity for a class of ch…

200 papers

New achievable rate regions are derived for the two-user additive white Gaussian multiple-access channel with noisy feedback. The regions exhibit the following two properties. Irrespective of the (finite) Gaussian feedback-noise variances,…

Information Theory · Computer Science 2010-04-13 Amos Lapidoth , Michele A. Wigger

Fundamental limits of the cognitive interference channel (CIC) with two pairs of transmitter-receiver has been under exploration for several years. In this paper, we study the discrete memoryless cognitive interference channel (DM-CIC) in…

Information Theory · Computer Science 2012-10-09 Mojtaba Vaezi

Sparsity in the delay-Doppler (DD) domain enables efficient channel estimation, but the realization-wise sparsity level is rarely known in advance, and it fluctuates. What if we could estimate the channel without ever knowing how many…

Information Theory · Computer Science 2026-05-04 Zijian Yang , Yulin Shao , Fen Hou , Shaodan Ma

In this paper, we examine discrete memoryless Multiple Access Channels (MACs) with two-sided feedback in the presence of two correlated channel states that are correlated in the sense of Slepian-Wolf (SW). We find achievable rate region for…

Information Theory · Computer Science 2012-12-17 Saeed Hajizadeh , Ghosheh Abed Hodtani

As a class of state-dependent channels, Markov channels have been long studied in information theory for characterizing the feedback capacity and error exponent. This paper studies a more general variant of such channels where the state…

Information Theory · Computer Science 2022-02-22 Mohsen Heidari , Achilleas Anastasopoulos , S. Sandeep Pradhan

We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting where a noisy classical channel is used in parallel with a perfect quantum channel. Each channel individually supports only a…

Quantum Physics · Physics 2026-02-10 Ambuj , Anushko Chattopadhyay , Kunika Agarwal , Rakesh Das , Amit Mukherjee

This work is motivated by a quite general question: Under which circumstances are the capacities of information transmission systems continuous? The research is explicitly carried out on arbitrarily varying quantum channels (AVQCs). We give…

Quantum Physics · Physics 2015-06-18 H. Boche , J. Noetzel

The identification capacity is developed without randomization at neither the encoder nor the decoder. In particular, full characterization is established for the deterministic identification (DI) capacity for the Gaussian channel and for…

Information Theory · Computer Science 2021-10-11 Mohammad J. Salariseddigh , Uzi Pereg , Holger Boche , Christian Deppe

End-to-end learning of communication systems enables joint optimization of transmitter and receiver, implemented as deep neural network-based autoencoders, over any type of channel and for an arbitrary performance metric. Recently, an…

Information Theory · Computer Science 2019-06-25 Mathieu Goutay , Fayçal Ait Aoudia , Jakob Hoydis

The capacity of a point-to-point discrete-time multi-input-multiple-output (MIMO) channel with phase uncertainty (MIMO phase noise channel) is still open. As a matter of fact, even the pre-log (multiplexing gain) of the capacity in the high…

Information Theory · Computer Science 2016-11-09 Sheng Yang , Shlomo Shamai

We study the best exponential decay in the blocklength of the probability of error that can be achieved in the transmission of a single bit over the Gaussian channel with an active noisy Gaussian feedback link. We impose an \emph{expected}…

Information Theory · Computer Science 2009-09-24 Young-Han Kim , Amos Lapidoth , Tsachy Weissman

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

An interference-limited noise-free CDMA downlink channel operating under a complexity constraint on the receiver is introduced. According to this paradigm, detected bits, obtained by performing hard decisions directly on the channel's…

Information Theory · Computer Science 2016-11-18 Ori Shental , Ido Kanter , Anthony J. Weiss

Information transmission over discrete-time channels with memoryless additive noise obeying a Cauchy, rather than Gaussian, distribution, are studied. The channel input satisfies an average power constraint. Upper and lower bounds to such…

Information Theory · Computer Science 2024-11-19 Shuqin Pang , Wenyi Zhang

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

Optimal coding over the additive white Gaussian noise channel under the peak energy constraint is studied when there is noisy feedback over an orthogonal additive white Gaussian noise channel. As shown by Pinsker, under the peak energy…

Information Theory · Computer Science 2011-08-19 Yu Xiang , Young-Han Kim

We consider the transmission of nonexponentially many messages through a binary symmetric channel with noiseless feedback. We obtain an upper bound for the best decoding error exponent. Combined with the corresponding known lower bound,…

Information Theory · Computer Science 2022-10-14 Marat V. Burnashev

We consider discrete memoryless channels with input alphabet size $n$ and output alphabet size $m$, where $m=$ceil$(\gamma n)$ for some constant $\gamma>0$. The channel transition matrix consists of entries that, before being normalised,…

Information Theory · Computer Science 2017-11-28 Tobias Sutter , David Sutter , John Lygeros

It is well known that, in general, feedback may enlarge the capacity region of Gaussian broadcast channels. This has been demonstrated even when the feedback is noisy (or partial-but-perfect) and only from one of the receivers. The only…

Information Theory · Computer Science 2015-02-18 Sibi Raj B. Pillai , Vinod M. Prabhakaran

We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple access channel with noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose feedback…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , Sennur Ulukus