Answers are grounded in this paper and cite their sources.
This paper studies the minimum achievable source coding rate as a function of blocklengthnand probability ϵ that the distortion exceeds a given leveld. 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 byR(d) + √V(d)/(n)Q-1(ϵ), whereR(d) is the rate-distortion function,V(d) is the rate dispersion, a characteristic of the source which measures its stochastic variability, andQ-1(·) is the inverse of the standard Gaussian complementary cumulative distribution function.
No takes yet. Share an insight, caveat, or question.
A 2012 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: