Subset-universal lossy compression

Or Ordentlich; Ofer Shayevitz

doi:10.1109/ITW.2015.7133146

Subset-universal lossy compression

Or Ordentlich
, Ofer Shayevitz

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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

Original language	English
Title of host publication	2015 IEEE Information Theory Workshop, ITW 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)	9781479955268
DOIs	https://doi.org/10.1109/ITW.2015.7133146
State	Published - 24 Jun 2015
Externally published	Yes
Event	2015 IEEE Information Theory Workshop, ITW 2015 - Jerusalem, Israel Duration: 26 Apr 2015 → 1 May 2015

Publication series

Name	2015 IEEE Information Theory Workshop, ITW 2015

Conference

Conference	2015 IEEE Information Theory Workshop, ITW 2015
Country/Territory	Israel
City	Jerusalem
Period	26/04/15 → 1/05/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access to Document

10.1109/ITW.2015.7133146

Cite this

@inproceedings{8d6791150ff2498abebf988c6c9ee6ab,

title = "Subset-universal lossy compression",

abstract = "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.",

author = "Or Ordentlich and Ofer Shayevitz",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; 2015 IEEE Information Theory Workshop, ITW 2015 ; Conference date: 26-04-2015 Through 01-05-2015",

year = "2015",

month = jun,

day = "24",

doi = "10.1109/ITW.2015.7133146",

language = "אנגלית",

series = "2015 IEEE Information Theory Workshop, ITW 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2015 IEEE Information Theory Workshop, ITW 2015",

address = "ארצות הברית",

}

TY - GEN

T1 - Subset-universal lossy compression

AU - Ordentlich, Or

AU - Shayevitz, Ofer

PY - 2015/6/24

Y1 - 2015/6/24

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

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

UR - https://www.scopus.com/pages/publications/84938910847

U2 - 10.1109/ITW.2015.7133146

DO - 10.1109/ITW.2015.7133146

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84938910847

T3 - 2015 IEEE Information Theory Workshop, ITW 2015

BT - 2015 IEEE Information Theory Workshop, ITW 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2015 IEEE Information Theory Workshop, ITW 2015

Y2 - 26 April 2015 through 1 May 2015

ER -

Subset-universal lossy compression

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this