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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2018 IEEE Information Theory Workshop (ITW) s. 1 - 5
Hlavní autoři: Kang, Wei, Liu, Nan
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2018
Témata:
Decoding
Markov processes
Random variables
Rate-distortion
Source coding
Upper bound
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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