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

Full description

Bibliographic Details

Published in:	2018 IEEE Information Theory Workshop (ITW) pp. 1 - 5
Main Authors:	Kang, Wei, Liu, Nan
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.11.2018
Subjects:	Decoding Markov processes Random variables Rate-distortion Source coding Upper bound
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!