Universal Decoding for Arbitrary Channels Relative to a Given Class of Decoding Metrics

We consider the problem of universal decoding for arbitrary, finite-alphabet unknown channels in the random coding regime. For a given random coding distribution and a given class of metric decoders, we propose a generic universal decoder whose average error probability is, within a subexponential m...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 59; H. 9; S. 5566 - 5576
1. Verfasser:	Merhav, Neri
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.09.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Access methods and protocols, osi model Applied sciences Channel coding Codes Coding, codes Entropy Error exponents Exact sciences and technology feedback finite-state machines Information theory Information, signal and communications theory Lempel-Ziv algorithm Maximum likelihood decoding Maximum likelihood method Measurement mismatched decoding multiple access channel (MAC) Probability distribution Signal and communications theory Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Teleprocessing networks. Isdn Transmission and modulation (techniques and equipments) universal decoding Vectors Alphabet Access control Multiple access Error probability multiple access channel (MAC) Lempel Ziv algorithm Finite state machine Feedback regulation Random coding Random distribution Mismatching Maximum likelihood decoding Lempel―Ziv algorithm feedback Universal coding Error exponents Metric finite―state machines Deterministic approach Multiple channel mismatched decoding universal decoding
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!