How many information bits does a decoder need about the channel statistics?

We investigate the minimum amount of side information about the channel statistics, that must be provided to the decoder in order to guarantee reliable communication in the random coding sense, for certain classes of channels.

[1]  Aaron D. Wyner,et al.  Classification with finite memory , 1996, IEEE Trans. Inf. Theory.

[2]  Jacob Ziv,et al.  Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.

[3]  Neri Merhav.  Universal decoding for memoryless Gaussian channels with a deterministic interference , 1993, IEEE Trans. Inf. Theory.

[4]  Sergio Verdú,et al.  A general formula for channel capacity , 1994, IEEE Trans. Inf. Theory.

[5]  Neri Merhav,et al.  On the amount of statistical side information required for lossy data compression , 1997, IEEE Trans. Inf. Theory.

[6]  Meir Feder,et al.  Universal decoders for channels with memory , 1996 .

[7]  Jacob Ziv,et al.  On fixed-database universal data compression with limited memory , 1997, IEEE Trans. Inf. Theory.

[8]  Sergio Verdú,et al.  Channel simulation and coding with side information , 1994, IEEE Trans. Inf. Theory.

[9]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.