dc.contributor.author | Kostina, Victoria | |
dc.contributor.author | Polyanskiy, Yury | |
dc.contributor.author | Verdu, Sergio | |
dc.date.accessioned | 2016-01-27T15:07:34Z | |
dc.date.available | 2016-01-27T15:07:34Z | |
dc.date.issued | 2014-06 | |
dc.identifier.isbn | 978-1-4799-5186-4 | |
dc.identifier.uri | http://hdl.handle.net/1721.1/100994 | |
dc.description.abstract | This paper studies the fundamental limits of the minimum average length of variable-length compression when a nonzero error probability ε is tolerated. We give non-asymptotic bounds on the minimum average length in terms of Erokhin's rate-distortion function and we use those bounds to obtain a Gaussian approximation on the speed of approach to the limit which is quite accurate for all but small blocklengths: equation where Q[superscript -1] (·) is the functional inverse of the Q-function and V (S) is the source dispersion. A nonzero error probability thus not only reduces the asymptotically achievable rate by a factor of 1-ε, but also this asymptotic limit is approached from below, i.e. a larger source dispersion and shorter blocklengths are beneficial. Further, we show that variable-length lossy compression under excess distortion constraint also exhibits similar properties. | en_US |
dc.description.sponsorship | National Science Foundation (U.S.). Science and Technology Center (Grant CCF-0939370) | en_US |
dc.language.iso | en_US | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/ISIT.2014.6875320 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | MIT web domain | en_US |
dc.title | Variable-length compression allowing errors | en_US |
dc.type | Article | en_US |
dc.identifier.citation | Kostina, Victoria, Yury Polyanskiy, and Sergio Verdu. “Variable-Length Compression Allowing Errors.” 2014 IEEE International Symposium on Information Theory (June 2014). | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
dc.contributor.mitauthor | Polyanskiy, Yury | en_US |
dc.relation.journal | Proceedings of the 2014 IEEE International Symposium on Information Theory | en_US |
dc.eprint.version | Author's final manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dspace.orderedauthors | Kostina, Victoria; Polyanskiy, Yury; Verdu, Sergio | en_US |
dc.identifier.orcid | https://orcid.org/0000-0002-2109-0979 | |
mit.license | OPEN_ACCESS_POLICY | en_US |