Subset-Universal Lossy Compression

Or Ordentlich; Ofer Shayevitz

Subset-Universal Lossy Compression

Information Theory 2015-03-13 v2 math.IT

Authors: Or Ordentlich , Ofer Shayevitz

Abstract

A lossy source code $\mathcal{C}$ with rate $R$ for a discrete memoryless source $S$ is called subset-universal if for every $0<R'< R$ , almost every subset of $2^{nR'}$ of its codewords achieves average distortion close to the source's distortion-rate function $D(R')$ . In this paper we prove the asymptotic existence of such codes. Moreover, we show the asymptotic existence of a code that is subset-universal with respect to all sources with the same alphabet.

Keywords

rate-distortion theory source coding

Cite

@article{arxiv.1411.0443,
  title  = {Subset-Universal Lossy Compression},
  author = {Or Ordentlich and Ofer Shayevitz},
  journal= {arXiv preprint arXiv:1411.0443},
  year   = {2015}
}

Comments

To be presented at the 2015 IEEE Information Theory Workshop

Related papers

View all related →