On the cost of finite block length in quantizing unbounded memoryless sources

DOI10.1109/18.485718MaRDI QIDQ4885678zbMATH OpenOpenAlexFDO

Authors Kenneth Zeger, Tamás Linder

Publication date 28 July 1996

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

Full work available at URL https://doi.org/10.1109/18.485718

zbMATH Keywords

distortion-rate functionfixed-rate quantizationmemoryless source

Mathematics Subject Classification ID

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

Recommendations

• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• On Finite Block-Length Quantization Distortion
• Quantization of Binary-Input Discrete Memoryless Channels
• Quantization of memoryless and Gauss-Markov sources over binary Markov channels
• Coding in the Finite-Blocklength Regime: Bounds Based on Laplace Integrals and Their Asymptotic Approximations
• Rate-distortion bound for a class of non-Gaussian sources with memory
• Fixed-Length Lossy Compression in the Finite Blocklength Regime
• Asymptotic bounds on optimal noisy channel quantization via random coding
• Optimal quantization for finite-state channels

Cited in

(5)

• Optimum quantizer performance for a class of non-Gaussian memoryless sources
• Low-Resolution Scalar Quantization for Gaussian Sources and Absolute Error
• On universal quantization by randomized uniform/lattice quantizers
• Variable-length coding for performance improvement of asymptotically optimal unrestricted polar quantization of bivariate Gaussian source
• Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources

This page was built for publication: On the cost of finite block length in quantizing unbounded memoryless sources

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