summaryrefslogtreecommitdiffstats
path: root/README
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 02:38:59 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 02:38:59 +0000
commita368a5b6742b7854f04058a862695a66fc1bb610 (patch)
tree969f7e0b7a42802e16f096818a1df8f6df96087b /README
parentAdding upstream version 1.14. (diff)
downloadlzlib-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 'README')
-rw-r--r--README2
1 files changed, 1 insertions, 1 deletions
diff --git a/README b/README
index 7dc2950..2207fb5 100644
--- a/README
+++ b/README
@@ -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.