English

Feedback Capacity of the Compound Channel

Information Theory 2016-11-15 v1 math.IT

Abstract

In this work we find the capacity of a compound finite-state channel with time-invariant deterministic feedback. The model we consider involves the use of fixed length block codes. Our achievability result includes a proof of the existence of a universal decoder for the family of finite-state channels with feedback. As a consequence of our capacity result, we show that feedback does not increase the capacity of the compound Gilbert-Elliot channel. Additionally, we show that for a stationary and uniformly ergodic Markovian channel, if the compound channel capacity is zero without feedback then it is zero with feedback. Finally, we use our result on the finite-state channel to show that the feedback capacity of the memoryless compound channel is given by infθmaxQXI(X;Yθ)\inf_{\theta} \max_{Q_X} I(X;Y|\theta).

Keywords

Cite

@article{arxiv.0711.0705,
  title  = {Feedback Capacity of the Compound Channel},
  author = {Brooke Shrader and Haim Permuter},
  journal= {arXiv preprint arXiv:0711.0705},
  year   = {2016}
}

Comments

34 pages, 2 figures, submitted to IEEE Transactions on Information Theory

R2 v1 2026-06-21T09:39:59.842Z