Data compression method combining properties of PPM and CTW

DOI10.1007/3-540-45884-0_18MaRDI QIDQ3044507zbMATH OpenFDO

Authors Takumi Okazaki, Kunihiko Sadakane, Hideki Imai

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2281/22810268.htm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An Algorithm for Universal Lossless Compression With Side Information
• A universal algorithm for sequential data compression
• Data compression
• Universal Data Compression Algorithm Based on Approximate String Matching
• scientific article; zbMATH DE number 1542846

Cited in

(6)

• Adding state merging to the DMC data compression algorithm
• Improving the efficiency of the PPM algorithm
• Superior guarantees for sequential prediction and lossless compression via alphabet decomposition
• An Algorithm for Universal Lossless Compression With Side Information
• Sequential prediction and ranking in universal context modeling and data compression
• Compression ratio boundaries for predictive signal compression

This page was built for publication: Data compression method combining properties of PPM and CTW

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