Dynamic Markov Compression. Predicts each bit with an adaptive finite-state Markov model (a binary tree that grows by cloning states shared by multiple significant paths) and codes it with a carryless binary arithmetic coder.
| Property | Value |
|---|---|
| Category | Compression Algorithms |
| Sub-category | Context Modeling |
| Security status | Not classified |
| Complexity | Expert |
| Inventor | Gordon V. Cormack, R. Nigel S. Horspool |
| Year | 1987 |
| Origin | 🇨🇦 Canada |
| Source | algorithms/compression/dmc.js |
Status: not classified — treat as unverified.
No vulnerabilities are recorded for this implementation.
3 vectors ship with this algorithm and run in the test suite. Byte values are hexadecimal.
Vector 1 — Empty input
| Field | Value |
|---|---|
input |
(empty) |
expected |
(empty) |
Vector 2 — Repetitive input - ‘AAAAAAAAAA’
| Field | Value |
|---|---|
input |
41414141414141414141 |
expected |
(empty) |
Vector 3 — Text sample - ‘the quick brown fox’
| Field | Value |
|---|---|
input |
74686520717569636b2062726f776e20666f78 |
expected |
(empty) |