Improving the efficiency of the PPM algorithm

DOI10.1023/A:1013878007506MaRDI QIDQ1812382zbMATH OpenOpenAlexFDO

Authors D. A. Shkarin

Publication date 19 June 2003

Published in Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1013878007506

zbMATH Keywords

Markov modelscomplexityescape probabilitiescharacter frequenciesdata compression algorithmsescape frequenciesinherited frequencies

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Dynamic-history predictive compression
• scientific article; zbMATH DE number 49083
• A normal sequence compressed by PPM* but not by Lempel-Ziv 78
• A universal algorithm for sequential data compression
• scientific article; zbMATH DE number 2086336

Cited in

(2)

• Efficiency issues in the KBMAG procedure
• ISSDC: digram coding based lossless data compression algorithm

This page was built for publication: Improving the efficiency of the PPM algorithm

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