Subset-universal lossy compression

Or Ordentlich, Ofer Shayevitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


A lossy source code C with rate R for a discrete memoryless source S is called subset-universal if for every 0 < R′ < R, almost every subset of 2nR′ 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.

Original languageAmerican English
Title of host publication2015 IEEE Information Theory Workshop, ITW 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479955268
StatePublished - 24 Jun 2015
Externally publishedYes
Event2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel
Duration: 26 Apr 20151 May 2015

Publication series

Name2015 IEEE Information Theory Workshop, ITW 2015


Conference2015 IEEE Information Theory Workshop, ITW 2015

Bibliographical note

Publisher Copyright:
© 2015 IEEE.


Dive into the research topics of 'Subset-universal lossy compression'. Together they form a unique fingerprint.

Cite this