summaryrefslogtreecommitdiffstats
path: root/README
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 02:39:06 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 02:39:06 +0000
commit19cb9cdfc26d8e209ca88cc10afe0cff554c499b (patch)
treed7711fad6f2ae6390e885c06838fedb4d05ce4b7 /README
parentUpdating to standards-version 4.7.0. (diff)
downloadlzlib-19cb9cdfc26d8e209ca88cc10afe0cff554c499b.tar.xz
lzlib-19cb9cdfc26d8e209ca88cc10afe0cff554c499b.zip
Merging upstream version 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.