English
Related papers

Related papers: Finite-State Channels with Feedback and State Know…

200 papers

We consider a two-user state-dependent multiaccess channel in which the states of the channel are known non-causally to one of the encoders and only strictly causally to the other encoder. Both encoders transmit a common message and, in…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Pablo Piantanida , Shlomo Shamai

We firstly extend the interpretation of feedback communication over stationary finite dimensional Gaussian channels as feedback control systems by showing that, the problem of finding stabilizing feedback controllers with maximal reliable…

Information Theory · Computer Science 2015-12-01 Chong Li , Nicola Elia

We consider a cooperative two-user multiaccess channel in which the transmission is controlled by a random state. Both encoders transmit a common message and, one of the encoders also transmits an individual message. We study the capacity…

Information Theory · Computer Science 2016-11-15 Abdellatif Zaidi , Shlomo Shamai

We study the performance limits of state-dependent discrete memoryless channels with a discrete state available at both the encoder and the decoder. We establish the epsilon-capacity as well as necessary and sufficient conditions for the…

Information Theory · Computer Science 2014-07-16 Marco Tomamichel , Vincent Y. F. Tan

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

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

Inspired by the ideas from the field of stochastic approximation, we propose a randomized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with…

Information Theory · Computer Science 2013-03-18 Guangyue Han

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 finite state Markov channel (FSMC), where the channel transition probability is controlled by a state undergoing a Markov process, is a useful model for the mobile wireless communication channel. In this paper, we investigate the…

Information Theory · Computer Science 2017-01-06 Bin Dai , Zheng Ma , Yuan Luo

A methodology is developed to realized optimal channel input conditional distributions, which maximize the finite-time horizon directed information, for channels with memory and feedback, by information lossless randomized strategies. The…

Information Theory · Computer Science 2016-04-06 Charalambos D. Charalambous , Christos K. Kourtellaris , Sergey Loyka

In this paper, we study the state-dependent two-user interference channel, where the state information is non-causally known at both transmitters but unknown to either of the receivers. We first propose two coding schemes for the discrete…

Information Theory · Computer Science 2015-03-19 Lili Zhang , Jinhua Jiang , Shuguang Cui

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

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 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

The capacity of a memoryless state-dependent channel is derived for a setting in which the encoder is provided with rate-limited assistance from a cribbing helper that observes the state sequence causally and the past channel inputs…

Information Theory · Computer Science 2024-01-24 Amos Lapidoth , Yossef Steinberg

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

We consider a two-user state-dependent multiaccess channel in which only one of the encoders is informed, non-causally, of the channel states. Two independent messages are transmitted: a common message transmitted by both the informed and…

Information Theory · Computer Science 2016-11-18 Abdellatif Zaidi , Shiva Prasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…

Information Theory · Computer Science 2021-09-29 Neri Merhav

The Finite Transmission Feedback Information (FTFI) capacity is characterized for any class of channel conditional distributions $\big\{{\bf P}_{B_i|B^{i-1}, A_i} :i=0, 1, \ldots, n\big\}$ and $\big\{ {\bf P}_{B_i|B_{i-M}^{i-1}, A_i} :i=0,…

Information Theory · Computer Science 2016-08-22 Christos K. Kourtellaris , Charalambos D. Charalambous

Shannon theory models communication as the reliable transfer of symbol sequences, with performance governed by capacity and rate-distortion limits. When both endpoints possess strong predictors -- as in modern large language models and…

Information Theory · Computer Science 2026-02-12 Ozgur Ercetin , Mohaned Chraiti