On Finite Blocklength Lossy Source Coding
Lin Zhou, Mehul Motani

TL;DR
This paper reviews recent advances in second-order asymptotics for finite blocklength lossy source coding, providing theoretical bounds and insights into practical quantization and multiterminal scenarios.
Contribution
It offers a comprehensive overview of second-order asymptotics in lossy source coding, including new bounds for various practical and multiterminal settings.
Findings
Theoretical bounds for noisy source and channel models.
Analysis of fixed-to-variable length compression.
Extensions to multiterminal source coding problems.
Abstract
In this monograph, we review recent advances in second-order asymptotics for lossy source coding, which provides approximations to the finite blocklength performance of optimal codes. The monograph is divided into three parts. In part I, we motivate the monograph, present basic definitions, introduce mathematical tools and illustrate the motivation of non-asymptotic and second-order asymptotics via the example of lossless source coding. In part II, we first present existing results for the rate-distortion problem with proof sketches. Subsequently, we present five generations of the rate-distortion problem to tackle various aspects of practical quantization tasks: noisy source, noisy channel, mismatched code, Gauss-Markov source and fixed-to-variable length compression. By presenting theoretical bounds for these settings, we illustrate the effect of noisy observation of the source, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Compression Techniques · Wireless Communication Security Techniques · Mathematical Approximation and Integration
