Fixed-Length Lossy Compression in the Finite Blocklength Regime

DOI10.1109/TIT.2012.2186786MaRDI QIDQ5271872zbMATH OpenOpenAlexFDO

Authors Victoria Kostina, Sergio Verdú

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1102.3944

Mathematics Subject Classification ID

Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Abstract: This paper studies the minimum achievable source coding rate as a function of blocklength $n$ and probability $epsilon$ that the distortion exceeds a given level $d$. 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 by $R(d)+sqrtfracV(d)n{Q}^{-1}(epsilon)$, where $R(d)$ is the rate-distortion function, $V(d)$ is the rate dispersion, a characteristic of the source which measures its stochastic variability, and $Q^{-1}(epsilon)$ is the inverse of the standard Gaussian complementary cdf.

Cited in

(8)

• Achievable complexity-performance tradeoffs in lossy compression
• Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel
• An information-theoretic framework for the lossy compression of link streams
• Output Constrained Lossy Source Coding With Limited Common Randomness
• Mismatched codebooks and the role of entropy coding in lossy data compression
• On the cost of finite block length in quantizing unbounded memoryless sources
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Second-order converses via reverse hypercontractivity

This page was built for publication: Fixed-Length Lossy Compression in the Finite Blocklength Regime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5271872)