pith. sign in

arxiv: 1404.5683 · v1 · pith:A3FDM3PAnew · submitted 2014-04-23 · 💻 cs.IT · math.IT

The Likelihood Encoder for Lossy Source Compression

classification 💻 cs.IT math.IT
keywords encoderlikelihoodsourcecodingcompressionlemmalossysoft-covering
0
0 comments X
read the original abstract

In this work, a likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on a soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering lemma gives alternative achievability proofs for classical source coding problems. The case of the rate-distortion function with side information at the decoder (i.e. the Wyner-Ziv problem) is carefully examined and an application of the likelihood encoder to the multi-terminal source coding inner bound (i.e. the Berger-Tung region) is outlined.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.