summaryrefslogtreecommitdiffstats
path: root/doc/lzip.texi
diff options
context:
space:
mode:
Diffstat (limited to '')
-rw-r--r--doc/lzip.texi6
1 files changed, 3 insertions, 3 deletions
diff --git a/doc/lzip.texi b/doc/lzip.texi
index 6d5cf77..865a413 100644
--- a/doc/lzip.texi
+++ b/doc/lzip.texi
@@ -6,8 +6,8 @@
@finalout
@c %**end of header
-@set UPDATED 26 January 2024
-@set VERSION 1.24
+@set UPDATED 1 March 2024
+@set VERSION 1.24.1
@dircategory Compression
@direntry
@@ -711,7 +711,7 @@ Lzip currently implements two variants of the LZMA algorithm: fast
(used by option @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.