Abstract
This paper studies the minimum achievable source coding rate as a function of blocklength and probability that the distortion exceeds a given level . Tight general achievability and converse bounds are derived that hold at arbitrary fixed blocklength. For stationary memoryless sources with separable distortion, the minimum rate achievable is shown to be closely approximated by , where is the rate-distortion function, is the rate dispersion, a characteristic of the source which measures its stochastic variability, and is the inverse of the standard Gaussian complementary cdf.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.