An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models

DOI10.1109/18.490547zbMATH Open0890.94020OpenAlexW2052258642MaRDI QIDQ4887060FDOQ4887060

Authors: Zhen Zhang, Enhui Yang 

Publication date: 3 July 1998

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

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

Recommendations

• An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
• Arbitrary source models and Bayesian codebooks in rate-distortion theory
• On the performance of recency-rank and block-sorting universal lossless data compression algorithms
• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
• A rate-distortion theorem for arbitrary discrete sources
• A suboptimal lossy data compression based on approximate pattern matching
• Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
• Symbol-Based Modeling and Coding of Block Markov Sources
• Universal data compression and repetition times

zbMATH Keywords

codebookrate distortion functioncodewordsMarkov sourcelossy data compressiongold-washing algorithm

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (2)

• An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
• Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases

This page was built for publication: An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models

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