@inproceedings{12908b4469ca430db3fb073b6e275043,
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 = "https://doi.org/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 = "الولايات المتّحدة",
}