Variable-Length Compression Allowing Errors
Abstract
This paper studies the fundamental limits of the minimum average length of lossless and lossy variable-length compression, allowing a nonzero error probability ε, for lossless compression. We give nonasymptotic 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: (1 − ε)kH(S) − ((kV(S)/2π))^1/2 exp[−((Q−1 (ε))^(2)/2)], where Q^−1 (·) is the functional inverse of the standard Gaussian complementary cumulative distribution 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 this asymptotic limit is approached from below, i.e., larger source dispersions and shorter blocklengths are beneficial. Variablelength lossy compression under an excess distortion constraint is shown to exhibit similar properties.
Additional Information
© 2015 IEEE. Manuscript received May 23, 2014; revised March 20, 2015; accepted May 6, 2015. Date of publication June 1, 2015; date of current version July 10, 2015. Date of publication June 1, 2015; date of current version July 10, 2015. This work was supported in part by the Division of Computing and Communication Foundations through NSF Science and Technology Center under Grant CCF-0939370 and in part by the Center for Science of Information and. This paper was presented at the 2014 ISIT.Attached Files
Submitted - 1402.0608.pdf
Files
Name | Size | Download all |
---|---|---|
md5:046c24a9e4ea3cee60c0675c0b2b7801
|
415.5 kB | Preview Download |
Additional details
- Eprint ID
- 59076
- DOI
- 10.1109/TIT.2015.2438831
- Resolver ID
- CaltechAUTHORS:20150729-151803634
- NSF
- CCF-0939370
- Center for Science of Information (CSoI)
- Created
-
2015-07-30Created from EPrint's datestamp field
- Updated
-
2021-11-10Created from EPrint's last_modified field