Abstract
In this work, we find the capacity of a compound finite-state channel (FSC) with time-invariant deterministic feedback. We consider the use of fixed length block codes over the compound channel. Our achievability result includes a proof of the existence of a universal decoder for the family of FSCs 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 FSC to show that the feedback capacity of the memoryless compound channel is given by infθ maxQX I(X;Y θ).
Original language | English |
---|---|
Pages (from-to) | 3629-3644 |
Number of pages | 16 |
Journal | IEEE Transactions on Information Theory |
Volume | 55 |
Issue number | 8 |
DOIs | |
State | Published - 12 Aug 2009 |
Keywords
- Causal conditioning probability
- Code-trees
- Compound channel
- Directed information
- Feedback capacity
- Finite-state channel (FSC)
- Gilbert-Elliot channel
- Pinsker's inequality
- Sanov's theorem
- Types of code-trees
- Universal decoder
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences