Data compression with low distortion and finite blocklength

Abstract

This paper considers lossy source coding of n-dimensional continuous memoryless sources with low mean-square error distortion and shows a simple, explicit approximation to the minimum source coding rate. More precisely, a nonasymptotic version of Shannon's lower bound is presented. Lattice quantizers are shown to approach that lower bound, provided that the source density is smooth enough and the distortion is low, which implies that fine multidimensional lattice coverings are nearly optimal in the rate-distortion sense even at finite n. The achievability proof technique avoids both the usual random coding argument and the simplifying assumption of the presence of a dither signal.

Additional Information

© 2015 IEEE. This work is supported by the Simons Institute for the Theory of Computing.

Attached Files

Submitted - 1510.02190v2.pdf

Files

Additional details