Computer Science – Information Theory
Scientific paper
2011-02-19
Computer Science
Information Theory
to appear in IEEE Transactions on Information Theory
Scientific paper
This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $\epsilon$ that the distortion exceeds a given level $d$. 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 $R(d) + \sqrt{\frac{V(d)}{n}} \Qinv{\epsilon}$, where $R(d)$ is the rate-distortion function, $V(d)$ is the {\it rate dispersion}, a characteristic of the source which measures its stochastic variability, and $\Qinv{\cdot}$ is the inverse of the standard Gaussian complementary cdf.
Kostina Victoria
Verdu Sergio
No associations
LandOfFree
Fixed-length lossy compression in the finite blocklength regime does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixed-length lossy compression in the finite blocklength regime, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-length lossy compression in the finite blocklength regime will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-159223