English
Related papers

Related papers: Feedback Capacity of the Compound Channel

200 papers

We consider capacity of discrete-time channels with feedback for the general case where the feedback is a time-invariant deterministic function of the output samples. Under the assumption that the channel states take values in a finite…

Information Theory · Computer Science 2009-09-29 Haim Permuter , Tsachy Weissman , Andrea Goldsmith

We consider finite state channels (FSCs) with feedback and state information known causally at the encoder. This setting is quite general and includes: a memoryless channel with i.i.d. state (the Shannon strategy), Markovian states that…

Information Theory · Computer Science 2022-12-27 Eli Shemuel , Oron Sabag , Haim H. Permuter

We consider finite state channels where the state of the channel is its previous output. We refer to these as POST (Previous Output is the STate) channels. We first focus on POST($\alpha$) channels. These channels have binary inputs and…

Information Theory · Computer Science 2013-09-24 Haim H. Permuter , Himanshu Asnani , Tsachy Weissman

It is known that for a discrete channel with correlated additive noise, the ordinary capacity with or without feedback both equal $ \log q-\mathcal{H} (Z) $, where $ \mathcal{H}(Z) $ is the entropy rate of the noise process $ Z $ and $ q $…

Information Theory · Computer Science 2020-06-02 Amir Saberi , Farhad Farokhi , Girish N. Nair

In this paper, we investigate the capacity of finite-state channels (FSCs) in presence of delayed feedback. We show that the capacity of a FSC with delayed feedback can be computed as that of a new FSC with instantaneous feedback and an…

Information Theory · Computer Science 2024-06-25 Bashar Huleihel , Oron Sabag , Haim H. Permuter , Victoria Kostina

A discrete compound channel with memory is considered, where no stationarity, ergodicity or information stability is required, and where the uncertainty set can be arbitrary. When the discrete noise is additive but otherwise arbitrary and…

Information Theory · Computer Science 2016-12-22 Sergey Loyka , Charalambos D. Charalambous

In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…

Quantum Physics · Physics 2009-11-13 I. Bjelakovic , H. Boche , J. Noetzel

We study a class of finite-state channels, known as POST channels, in which the previous channel output serves as the current state. A POST channel is deemed approximately memoryless when the state-dependent transition matrices are…

Information Theory · Computer Science 2026-03-11 Xiaojing Zhang , Jun Chen , Guanghui Wang

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

A class of burst noise-erasure channels which incorporate both errors and erasures during transmission is studied. The channel, whose output is explicitly expressed in terms of its input and a stationary ergodic noise-erasure process, is…

Information Theory · Computer Science 2017-05-05 Lin Song , Fady Alajaji , Tamás Linder

The fundamental limits of communication over state-dependent discrete memoryless channels with noiseless feedback are studied, under the assumption that the communicating parties are allowed to use variable-length coding schemes. Various…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Carol Wang , Vincent Y. F. Tan

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We characterize both an inner and an outer bound for this…

Information Theory · Computer Science 2009-11-23 Haim Permuter , Tsachy Weissman

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 consider the feedback capacity of a MIMO channel whose channel output is given by a linear state-space model driven by the channel inputs and a Gaussian process. The generality of our state-space model subsumes all previous studied…

Information Theory · Computer Science 2022-07-22 Oron Sabag , Victoria Kostina , Babak Hassibi

We consider a unit memory channel, called Binary State Symmetric Channel (BSSC), in which the channel state is the modulo2 addition of the current channel input and the previous channel output. We derive closed form expressions for the…

Information Theory · Computer Science 2015-07-03 Christos K. Kourtellaris , Charalambos D. Charalambous

We address the problem of universal communications over an unknown channel with an instantaneous noiseless feedback, and show how rates corresponding to the empirical behavior of the channel can be attained, although no rate can be…

Information Theory · Computer Science 2008-09-01 Ofer Shayevitz , Meir Feder

In this paper, we examine an input-constrained erasure channel and we characterize the asymptotics of its capacity when the erasure rate is low. More specifically, for a general memoryless erasure channel with its input supported on an…

Information Theory · Computer Science 2016-05-10 Yonglong Li , Guangyue Han

We characterize the capacity region to within 2 bits/s/Hz and the symmetric capacity to within 1 bit/s/Hz for the two-user Gaussian interference channel (IC) with feedback. We develop achievable schemes and derive a new outer bound to…

Information Theory · Computer Science 2010-05-20 Changho Suh , David Tse

This article studies the zero-error feedback capacity of {\em causal} discrete channels with memory. First, by extending the classical zero-error feedback capacity concept, a new notion of {\em uniform zero-error feedback capacity} $ C_{0f}…

Information Theory · Computer Science 2022-06-02 Amir Saberi , Farhad Farokhi , Girish Nair

The zero-error feedback capacity of the Gelfand-Pinsker channel is established. It can be positive even if the channel's zero-error capacity is zero in the absence of feedback. Moreover, the error-free transmission of a single bit may…

Information Theory · Computer Science 2016-07-11 Annina Bracher , Amos Lapidoth
‹ Prev 1 2 3 10 Next ›