论文信息 - The Compound Channel Capacity of a Class of Finite-State Channels

The Compound Channel Capacity of a Class of Finite-State Channels

A transmitter and receiver need to be designed to guarantee reliable communication on any channel belonging to a given family of finite-state channels defined over common finite input, output, and state alphabets. Both the transmitter and receiver are assumed to be ignorant of the channel over which transmission is carried out and also ignorant of its initial state. For this scenario we derive an expression for the highest achievable rate. As a special case we derive the compound channel capacity of a class of Gilbert-Elliott channels.

Emre Telatar | Amos Lapidoth | A. Lapidoth | E. Telatar

[1] Meir Feder,et al. Universal Decoding for Channels with Memory , 1998, IEEE Trans. Inf. Theory.

[2] Laurent Mevel,et al. Geometric Ergodicity in Hidden Markov Models , 1996 .

[3] Israel Bar-David,et al. Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[4] D. Blackwell,et al. The Capacities of Certain Channel Classes Under Random Coding , 1960 .

[5] Pravin Varaiya,et al. Capacity, mutual information, and coding for finite-state Markov channels , 1996, IEEE Trans. Inf. Theory.

[6] D. Blackwell,et al. The Capacity of a Class of Channels , 1959 .

[7] Thomas Kaijser. A Limit Theorem for Partially Observed Markov Chains , 1975 .

[8] J. Wolfowitz. Coding Theorems of Information Theory , 1962, Ergebnisse der Mathematik und Ihrer Grenzgebiete.

[9] Imre Csiszár,et al. Capacity of the Gaussian arbitrarily varying channel , 1991, IEEE Trans. Inf. Theory.

[10] P. Varaiya,et al. Capacity of Classes of Gaussian Channels , 1968 .

[11] R. Gallager. Information Theory and Reliable Communication , 1968 .

[12] Meir Feder,et al. Universal decoding for noisy channels , 1996 .