Title :
Universal decoding for noisy channels: an algorithmic approach
Author :
Lapidoth, Amos ; Ziv, Jacob
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA
fDate :
29 Jun-4 Jul 1997
Abstract :
It is shown that Ziv´s (1985) decoding algorithm, which was originally shown to be universal for the family of all finite state channels with deterministic (but unknown) state transitions, is universal for the more general family of all finite state channels. It is also shown that the generalized maximum-likelihood decoder need not be universal even for families that admit universal decoding
Keywords :
coding errors; discrete systems; maximum likelihood decoding; memoryless systems; noise; telecommunication channels; Ziv decoding algorithm; deterministic state transitions; discrete memoryless channels; finite state channels; generalized maximum-likelihood decoder; noisy channels; universal decoding; Books; Codes; Data compression; Intersymbol interference; Jacobian matrices; Maximum likelihood decoding; Memoryless systems; Merging; Mutual information;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613336
