Universal decoding for channels with memory
Authors:
- A. LapidothALA. Lapidoth
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 44 (5) , 1726-1745
Abstract
A universal decoder for a parametric family of channels is a decoder whose structure depends on the family but not on the individual channel over which transmission takes place, and it yet attains the same random-coding error exponent as the maximum-likelihood receiver tuned to the channel in use. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown that under somewhat stronger conditions on the family of channels, the convergence of the performance of the universal decoder to that of the optimal decoder is uniform over the set of channels. Examples of families for which universal decoding is demonstrated include the family of finite-state channels and the family of Gaussian intersymbol interference channelsKeywords
This publication has 30 references indexed in Scilit:
- The compound channel capacity of a class of finite-state channelsIEEE Transactions on Information Theory, 1998
- Mismatched decoding and the multiple-access channelIEEE Transactions on Information Theory, 1996
- A new universal random coding bound for the multiple-access channelIEEE Transactions on Information Theory, 1996
- Hierarchical universal codingIEEE Transactions on Information Theory, 1996
- Arbitrarily varying channels with general alphabets and statesIEEE Transactions on Information Theory, 1992
- The capacity of the arbitrarily varying channel revisited: positivity, constraintsIEEE Transactions on Information Theory, 1988
- Random coding bound and codes produced by permutations for the multiple-access channelIEEE Transactions on Information Theory, 1985
- Exponential error bounds for random codes in the arbitrarily varying channelIEEE Transactions on Information Theory, 1985
- The Capacities of Certain Channel Classes Under Random CodingThe Annals of Mathematical Statistics, 1960
- The Capacity of a Class of ChannelsThe Annals of Mathematical Statistics, 1959