summaryrefslogtreecommitdiffstats
path: root/README
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-03-03 14:04:59 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-03-03 14:04:59 +0000
commit4efb97359112689f1df0690f9b838cea963a9460 (patch)
treec2f4352237b3101986b8085626f0d77f6cfa18c7 /README
parentAdding upstream version 1.24. (diff)
downloadlzip-4efb97359112689f1df0690f9b838cea963a9460.tar.xz
lzip-4efb97359112689f1df0690f9b838cea963a9460.zip
Adding upstream version 1.24.1.upstream/1.24.1upstream
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 2c78858..a4806ce 100644
--- a/README
+++ b/README
@@ -110,7 +110,7 @@ Lzip currently implements two variants of the LZMA algorithm: fast
(used by option '-0') 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.