pith. sign in

arxiv: 1102.2598 · v1 · pith:6EPSAYRKnew · submitted 2011-02-13 · 💻 cs.IT · math.IT

The Dispersion of Lossy Source Coding

classification 💻 cs.IT math.IT
keywords dispersioncodingdistortionexcessaboveblockchannelconstant
0
0 comments X
read the original abstract

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding rate above the rate-distortion function is inversely proportional (to the first order) to the square root of the block length. We give an explicit expression for the proportion constant, which is given by the inverse Q-function of the allowed excess distortion probability, times the square root of a constant, termed the excess distortion dispersion. This result is the dual of a corresponding channel coding result, where the dispersion above is the dual of the channel dispersion. The work treats discrete memoryless sources, as well as the quadratic-Gaussian case.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.