Feedback Capacity of the Compound Channel
Author(s)
Shrader, Brooke E.; Permuter, Haim
DownloadShrader-2007-Feedback Capacity of.pdf (367.4Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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[subscript thetas] max[subscript QX] I(X; Y |thetas).
Date issued
2009-07Department
Lincoln LaboratoryJournal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers
Citation
Shrader, B., and H. Permuter. “Feedback Capacity of the Compound Channel.” Information Theory, IEEE Transactions on 55.8 (2009): 3629-3644. © 2009 IEEE
Version: Final published version
ISSN
0018-9448
Keywords
universal decoder, types of code-trees, finite-state channel (FSC), feedback capacity, directed information, compound channel, code-trees, Sanov's theorem, Pinsker's inequality, Gilbert–Elliot channel, Causal conditioning probability