A converse for lossy source coding in the finite blocklength regime

We present a converse bound for lossy source coding in the finite blocklength regime. The bound is based on d-tilted information, and it combines ideas from two different converse techniques by Kostina and Verdú. When particularised to the binary and Gaussian memoryless sources, the new bound gives slightly tighter results in certain blocklength regimes.

[1]  Tomohiko Uyematsu,et al.  Non-asymptotic bounds for fixed-length lossy compression , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[2]  R. Gray.  Entropy and Information Theory , 1990, Springer New York.

[3]  Sergio Verdú,et al.  Fixed-Length Lossy Compression in the Finite Blocklength Regime , 2011, IEEE Transactions on Information Theory.

[4]  S. Li.  Concise Formulas for the Area and Volume of a Hyperspherical Cap , 2011 .