TY - GEN
T1 - Subset-universal lossy compression
AU - Ordentlich, Or
AU - Shayevitz, Ofer
N1 - Publisher Copyright:
© 2015 IEEE.
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 - http://www.scopus.com/inward/record.url?scp=84938910847&partnerID=8YFLogxK
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 -