|
|
|
|
LEADER |
01728 am a22002053u 4500 |
001 |
100994 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Kostina, Victoria
|e author
|
100 |
1 |
0 |
|a Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
|e contributor
|
100 |
1 |
0 |
|a Polyanskiy, Yury
|e contributor
|
700 |
1 |
0 |
|a Polyanskiy, Yury
|e author
|
700 |
1 |
0 |
|a Verdu, Sergio
|e author
|
245 |
0 |
0 |
|a Variable-length compression allowing errors
|
260 |
|
|
|b Institute of Electrical and Electronics Engineers (IEEE),
|c 2016-01-27T15:07:34Z.
|
856 |
|
|
|z Get fulltext
|u http://hdl.handle.net/1721.1/100994
|
520 |
|
|
|a 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.
|
520 |
|
|
|a National Science Foundation (U.S.). Science and Technology Center (Grant CCF-0939370)
|
546 |
|
|
|a en_US
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t Proceedings of the 2014 IEEE International Symposium on Information Theory
|