The compound channel capacity of a class of finite-state channels

Author

Lapidoth, Amos ; Telatar, I. Emre

Author_Institution

Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA

Volume

44

Issue

3

fYear

1998

fDate

5/1/1998 12:00:00 AM

Firstpage

973

Lastpage

983

Abstract

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

Keywords

channel capacity; channel coding; decoding; receivers; transmitters; Gilbert-Elliott channels; channel coding; codebook; compound channel capacity; decoding; finite input alphabet; finite output alphabet; finite state alphabet; finite-state channels; highest achievable rate; receiver; reliable communication; transmitter; Career development; Channel capacity; Dispersion; Engineering profession; Feedback; Maximum likelihood decoding; Memoryless systems; Nonlinear filters; Robustness; Transmitters;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.669134

Filename

669134