diff options
| author | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-27 02:38:59 +0000 |
|---|---|---|
| committer | Daniel Baumann <daniel.baumann@progress-linux.org> | 2024-04-27 02:38:59 +0000 |
| commit | a368a5b6742b7854f04058a862695a66fc1bb610 (patch) | |
| tree | 969f7e0b7a42802e16f096818a1df8f6df96087b /README | |
| parent | Adding upstream version 1.14. (diff) | |
| download | lzlib-a368a5b6742b7854f04058a862695a66fc1bb610.tar.xz lzlib-a368a5b6742b7854f04058a862695a66fc1bb610.zip | |
Adding upstream version 1.15~pre1.upstream/1.15_pre1
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to '')
| -rw-r--r-- | README | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -83,7 +83,7 @@ Lzlib currently implements two variants of the LZMA algorithm: fast (used by option '-0' of minilzip) and normal (used by all other compression levels). The high compression of LZMA comes from combining two basic, well-proven -compression ideas: sliding dictionaries (LZ77) and markov models (the thing +compression ideas: sliding dictionaries (LZ77) and Markov models (the thing used by every compression algorithm that uses a range encoder or similar order-0 entropy coder as its last stage) with segregation of contexts according to what the bits are used for. |