An Upper bound on the Error Exponent in Lossless Source Coding with a Helper

In this paper, we study the error exponent in the problem of lossless source coding with a helper. We use the inherently typical subset lemma to remove the Markov chain constraint in the proof of the converse and obtain an upper bound on the error exponent, which is very close to the existing lower...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2018 IEEE Information Theory Workshop (ITW) S. 1 - 5
Hauptverfasser: Kang, Wei, Liu, Nan
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.11.2018
Schlagworte:
Decoding
Markov processes
Random variables
Rate-distortion
Source coding
Upper bound
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we study the error exponent in the problem of lossless source coding with a helper. We use the inherently typical subset lemma to remove the Markov chain constraint in the proof of the converse and obtain an upper bound on the error exponent, which is very close to the existing lower bound. The proposed upper bound and the existing lower bound meet when the rate pair is close to the boundary of the optimal rate region.
DOI:10.1109/ITW.2018.8613497