| Versions tested: | 1 |
| Optimal parameters: | - |
| Links: | http://cs.fit.edu/~m... |
| Authors: | Matt Mahoney |
| Algorithms: | BWT+CM |
| Notable peformances: | - |
the source codeThe compression format is a memory efficient Burrows-Wheeler Transform (BWT) followed by a PAQ-like compression using a single order-0 context (no mixing) followed by 5 more adaptive stages with low order contexts, and bitwise arithmetic coding.
The compressor is featured in the BWT comparison.
(Have info that should be added here? E-mail.)
| Ver | Rating | CPR | DPR | S.E. | R.E. | Ratio | C. kB/s | D. kB/s | ||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| c | ||||||||||||
| 1 | 27 | 14 | 160 | 17 | 3 | 3.142 | 75 | 757 | ||||
| cfm100q | ||||||||||||
| 1 | freezes due to bwt string sort (app1) | |||||||||||
| cm400q | ||||||||||||
| 1 | freezes due to bwt string sort (app1) | |||||||||||