Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Improving the efficiency of the PPM algorithm

From MaRDI portal
Publication:1812382
Jump to:navigation, search

DOI10.1023/A:1013878007506zbMATH Open1021.94010OpenAlexW1608648538MaRDI QIDQ1812382

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

complexityMarkov modelsdata compression algorithmsescape probabilitiescharacter frequenciesescape frequenciesinherited frequencies


Mathematics Subject Classification ID

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



Related Items (1)

Efficiency issues in the KBMAG procedure






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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1812382&oldid=14176678"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 10:34.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki