diff options
| author | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-06 12:52:24 +0000 |
|---|---|---|
| committer | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-06 12:52:24 +0000 |
| commit | f3418da4287ccac0e1139dacde5669aa091fadb1 (patch) | |
| tree | 0a24633209a77b4bbe7ceb1f2c582f69aaaca102 /README | |
| parent | Adding upstream version 1.7~pre1. (diff) | |
| download | clzip-f3418da4287ccac0e1139dacde5669aa091fadb1.tar.xz clzip-f3418da4287ccac0e1139dacde5669aa091fadb1.zip | |
Adding upstream version 1.7~rc1.upstream/1.7_rc1
Signed-off-by: Daniel Baumann <mail@daniel-baumann.ch>
Diffstat (limited to '')
| -rw-r--r-- | README | 21 |
1 files changed, 11 insertions, 10 deletions
@@ -3,7 +3,7 @@ Description Clzip is a lossless data compressor with a user interface similar to the one of gzip or bzip2. Clzip is about as fast as gzip, compresses most files more than bzip2, and is better than both from a data recovery -perspective. Clzip is a clean implementation of the LZMA "algorithm". +perspective. Clzip uses the lzip file format; the files produced by clzip are fully compatible with lzip-1.4 or newer, and can be rescued with lziprecover. @@ -81,15 +81,16 @@ multivolume compressed tar archives. Clzip is able to compress and decompress streams of unlimited size by automatically creating multi-member output. The members so created are -large, about 64 PiB each. - -There is no such thing as a "LZMA algorithm"; it is more like a "LZMA -coding scheme". For example, the option '-0' of lzip uses the scheme in -almost the simplest way possible; issuing the longest match it can find, -or a literal byte if it can't find a match. Inversely, a much more -elaborated way of finding coding sequences of minimum price than the one -currently used by lzip could be developed, and the resulting sequence -could also be coded using the LZMA coding scheme. +large, about 2 PiB each. + +In spite of its name (Lempel-Ziv-Markov chain-Algorithm), LZMA is not a +concrete algorithm; it is more like "any algorithm using the LZMA coding +scheme". For example, the option '-0' of lzip uses the scheme in almost +the simplest way possible; issuing the longest match it can find, or a +literal byte if it can't find a match. Inversely, a much more elaborated +way of finding coding sequences of minimum size than the one currently +used by lzip could be developed, and the resulting sequence could also +be coded using the LZMA coding scheme. Clzip currently implements two variants of the LZMA algorithm; fast (used by option -0) and normal (used by all other compression levels). |