Dynamic Markov compression

Dynamic Markov compression (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool. 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 hook by Nania Francesco Antonio, ocamyd by Frank Schwellinger, and as a submodel in paq8l by Matt Mahoney. These are based on the 1993 implementation in C by Gordon Cormack.

Comment
enDynamic Markov compression (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool. 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 hook by Nania Francesco Antonio, ocamyd by Frank Schwellinger, and as a submodel in paq8l by Matt Mahoney. These are based on the 1993 implementation in C by Gordon Cormack.
Has abstract
enDynamic Markov compression (DMC) is a lossless data compression algorithm developed by Gordon Cormack and Nigel Horspool. 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 hook by Nania Francesco Antonio, ocamyd by Frank Schwellinger, and as a submodel in paq8l by Matt Mahoney. These are based on the 1993 implementation in C by Gordon Cormack.
Hypernym
Algorithm
Is primary topic of
Dynamic Markov compression
Label
enDynamic Markov compression
Link from a Wikipage to an external page
web.archive.org/web/20070630111546/http:/plg.uwaterloo.ca/~ftp/dmc/dmc.c
www.cs.uvic.ca/~nigelh/Publications/DMC.pdf
web.archive.org/web/20091026235047/http:/de.geocities.com/ocamyd/
cs.fit.edu/~mmahoney/compression/text.html%231781
www.youtube.com/watch%3Fv=05RFEGWNxts
Link from a Wikipage to another Wikipage
Algorithm
Arithmetic coding
Category:Lossless compression algorithms
Category:Markov models
Claude Shannon
Context mixing
Data compression
Gordon Cormack
Nigel Horspool
PAQ
Prediction by partial matching
SameAs
Dinamička Markovljeva kompresija
DMC (алгоритм сжатия)
Dynamic Markov compression
m.02qy3lv
Modélisation de Markov dynamique
Q1588713
ZmgD
動態馬可夫壓縮
Subject
Category:Lossless compression algorithms
Category:Markov models
WasDerivedFrom
Dynamic Markov compression?oldid=1120516230&ns=0
WikiPageLength
8406
Wikipage page ID
11014633
Wikipage revision ID
1120516230
WikiPageUsesTemplate
Template:Compression Methods
Template:Plays audio
Template:Reflist