English
Related papers

Related papers: Feedback Does Not Increase the Capacity of Approxi…

200 papers

We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specifically, the instantaneous feedback is a function of an action…

Information Theory · Computer Science 2016-11-18 Himanshu Asnani , Haim Permuter , Tsachy Weissman

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

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

We study the problem of generating an approximately i.i.d. string at the output of a discrete memoryless channel using a limited amount of randomness at its input in presence of causal noiseless feedback. Feedback does not decrease the…

Information Theory · Computer Science 2016-09-29 Mani Bastani Parizi , Emre Telatar

The reliability function of memoryless channels with noiseless feedback and variable-length coding has been found to be a linear function of the average rate in the classic work of Burnashev. In this work we consider unifilar channels with…

Information Theory · Computer Science 2017-07-13 Achilleas Anastasopoulos , Jui Wu

Which communication rates can be attained over a channel whose output is an unknown (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? Following the spirit of the finite-state…

Information Theory · Computer Science 2013-03-21 Yuval Lomnitz , Meir Feder

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…

Information Theory · Computer Science 2022-07-12 YuHao Liu , Teng Fu , Jean Barbier , TianQi Hou

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

In this paper, we consider some long-standing problems in communication systems with access to noisy feedback. We introduce a new notion, the residual directed information, to capture the effective information flow (i.e. mutual information…

Information Theory · Computer Science 2015-03-19 Chong Li , Nicola Elia

The classical capacity of phase-invariant Gaussian channels has been recently determined under the assumption that such channels are memoryless. In this work we generalize this result by deriving the classical capacity of a model of quantum…

Quantum Physics · Physics 2014-10-17 Giacomo De Palma , Andrea Mari , Vittorio Giovannetti

We propose two coding schemes for the two-receiver discrete memoryless broadcast channel (BC) with rate-limited feedback from one or both receivers. They improve over the nofeedback capacity region for a large class of channels, including…

Information Theory · Computer Science 2016-02-19 Youlong Wu , Michèle Wigger

Variable length communication over a compound channel with feedback is considered. Traditionally, capacity of a compound channel without feedback is defined as the maximum rate that is determined before the start of communication such that…

Information Theory · Computer Science 2011-06-30 Aditya Mahajan , Sekhar Tatikonda

In part I, we reviewed how Shannon's classical notion of capacity is not sufficient to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize an unstable scalar linear…

Information Theory · Computer Science 2007-12-06 Anant Sahai , Sanjoy Mitter

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

We consider a communication scenario over a discrete memoryless interference channel or multiple access channel without feedback, where transmitters exploit classical, quantum, or no-signaling cooperation. In this scenario, several previous…

Quantum Physics · Physics 2026-01-05 Seung-Hyun Nam , Hyun-Young Park , Jiyoung Yun , Ashutosh Rai , Si-Hyeon Lee , Joonwoo Bae

We investigate the multiple use of a ferromagnetic spin chain for quantum and classical communications without resetting. We find that the memory of the state transmitted during the first use makes the spin chain a qualitatively different…

Quantum Physics · Physics 2009-11-13 A. Bayat , D. Burgarth , S. Mancini , S. Bose

Particularly motivated by DNA storage channels, we consider channels with synchronization errors modeled as insertions and deletions, along with substitutions. We focus on the case where the synchronization error process has memory and…

Information Theory · Computer Science 2026-04-14 Ruslan Morozov , Tolga M. Duman

It is known that the capacity region of a two user physically degraded discrete memoryless (DM) broadcast channel (BC) is not enlarged by feedback. An identical result holds true for a physically degraded Gaussian BC, established later…

Information Theory · Computer Science 2017-04-20 Viswanathan Ramachandran , S. R. B. Pillai

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by…

Quantum Physics · Physics 2009-09-30 Nilanjana Datta , Yurii Suhov , Tony C. Dorlas

The essential interactive capacity of a discrete memoryless channel is defined in this paper as the maximal rate at which the transcript of any interactive protocol can be reliably simulated over the channel, using a deterministic coding…

Information Theory · Computer Science 2021-08-13 Assaf Ben-Yishai , Young-Han Kim , Or Ordentlich , Ofer Shayevitz
‹ Prev 1 3 4 5 6 7 10 Next ›