Revision as of 12:26, 10 June 2014 edit Naufraghi (talk \| contribs) 10 edits Undid revision 609518672 by XLinkBot (talk) The link points to an introductory tutorial by Google about Markov Chain Compression Tag: reverting anti-vandal bot ← Previous edit		Revision as of 20:56, 9 September 2016 edit undo GreenC bot (talk \| contribs) Bots 3,054,792 edits m WaybackMedic 2 Next edit →
Line 1: '''Dynamic Markov compression''' ('''DMC''') is a lossless [[data compression]] [[algorithm]] developed by [[Gordon Cormack]] and [[Nigel Horspool]].<ref>Gordon Cormack and Nigel Horspool, "Data Compression using Dynamic Markov Modelling", Computer Journal 30:6 (December 1987)</ref> It uses predictive [[arithmetic coding]] similar to [[prediction by partial matching]] (PPM), except that the input is predicted one bit at a time (rather than one byte at a time). DMC has a good compression ratio and moderate speed, similar to PPM, but requires somewhat more memory and is not widely implemented. Some recent implementations include the experimental compression programs [http://cs.fit.edu/~mmahoney/compression/text.html#1781 hook] by Nania Francesco Antonio, [~~http~~https://web.archive.org/web/20091026235047/http://de.geocities.com/ocamyd/ ocamyd] by Frank Schwellinger, and as a submodel in [[PAQ\|paq8l]] by Matt Mahoney. These are based on the [http://plg.uwaterloo.ca/~ftp/dmc/dmc.c 1993 implementation] in C by Gordon Cormack. == Algorithm ==

Dynamic Markov compression: Difference between revisions