Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ITW.2015.7133146 | Information Theory Workshop |
Keywords | Field | DocType |
data compression,distortion,source coding,discrete memoryless source,lossy source code,source distortion-rate function,subset-universal lossy compression | Discrete mathematics,Average distortion,Lossy compression,Source code,Code (cryptography),Mathematics,Alphabet | Conference |
ISBN | Citations | PageRank |
978-1-4799-5524-4 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Or Ordentlich | 1 | 121 | 18.37 |
| Ofer Shayevitz | 2 | 158 | 26.41 |