An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis

DOI10.1109/18.705559zbMATH Open0994.94021OpenAlexW2142874880MaRDI QIDQ4701157

Zhen Zhang, Enhui Yang

Publication date: 21 November 1999

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

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

zbMATH Keywords

adaptive vector quantization algorithmGold-washing data compression algorithm

Mathematics Subject Classification ID

Theory of data (68P99) Coding theorems (Shannon theory) (94A24) Source coding (94A29) Rate-distortion theory in information and communication theory (94A34)

Related Items (2)

Redundancy of Lossless Data Compression for Known Sources by Analytic Methods ⋮ An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results

This page was built for publication: An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis

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