论文信息 - Universal decoders for channels with memory

Universal decoders for channels with memory

A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such a decoder is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family.

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

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

[3] Amos Lapidoth,et al. Mismatched decoding and the multiple-access channel , 1994, IEEE Trans. Inf. Theory.

[4] Shlomo Shamai,et al. On information rates for mismatched decoders , 1994, IEEE Trans. Inf. Theory.

[5] Erik Ordentlich,et al. Universal portfolios with side information , 1996, IEEE Trans. Inf. Theory.

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

[7] Amos Lapidoth,et al. Nearest neighbor decoding for additive non-Gaussian noise channels , 1996, IEEE Trans. Inf. Theory.

[8] Imre Csiszár,et al. Channel capacity for a given decoding metric , 1995, IEEE Trans. Inf. Theory.

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

[10] Vladimir B. Balakirsky. A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels , 1995, IEEE Trans. Inf. Theory.

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

[12] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .