Universal decoding for channels with memory

Meir Feder, Amos Lapidoth

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We show the existence and structure of a universal decoder, which is independent of the channel yet attains the same random coding error exponent as can be attained by the best decoder tuned to the channel. This result hold for general parametric families of channels, and requires only relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family.

Original languageEnglish
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Pages398
Number of pages1
DOIs
StatePublished - 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: 29 Jun 19974 Jul 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1997 IEEE International Symposium on Information Theory, ISIT 1997
Country/TerritoryGermany
CityUlm
Period29/06/974/07/97

Fingerprint

Dive into the research topics of 'Universal decoding for channels with memory'. Together they form a unique fingerprint.

Cite this