diff options
| author | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 10:05:58 +0000 |
|---|---|---|
| committer | Daniel Baumann <mail@daniel-baumann.ch> | 2015-11-07 10:05:58 +0000 |
| commit | afb941b5eca62a119b7917fd7e833ee807bd6156 (patch) | |
| tree | 195cc774a8e0a21a67bbb0fc08f6b8c59f0f442e /README | |
| parent | Adding debian version 1.16-2. (diff) | |
| download | lzip-afb941b5eca62a119b7917fd7e833ee807bd6156.tar.xz lzip-afb941b5eca62a119b7917fd7e833ee807bd6156.zip | |
Merging upstream version 1.17~pre1.
Signed-off-by: Daniel Baumann <mail@daniel-baumann.ch>
Diffstat (limited to 'README')
| -rw-r--r-- | README | 13 |
1 files changed, 7 insertions, 6 deletions
@@ -5,8 +5,9 @@ one of gzip or bzip2. Lzip is about as fast as gzip, compresses most files more than bzip2, and is better than both from a data recovery perspective. Lzip is a clean implementation of the LZMA "algorithm". -The lzip file format is designed for long-term data archiving, taking -into account both data integrity and decoder availability: +The lzip file format is designed for data sharing and long-term +archiving, taking into account both data integrity and decoder +availability: * The lzip format provides very safe integrity checking and some data recovery means. The lziprecover program can repair bit-flip errors @@ -21,8 +22,8 @@ into account both data integrity and decoder availability: extract the data from a lzip file long after quantum computers eventually render LZMA obsolete. - * Additionally lzip is copylefted, which guarantees that it will - remain free forever. + * Additionally the lzip reference implementation is copylefted, which + guarantees that it will remain free forever. A nice feature of the lzip format is that a corrupt byte is easier to repair the nearer it is from the beginning of the file. Therefore, with @@ -81,7 +82,7 @@ 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 +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. @@ -101,7 +102,7 @@ range encoding), Igor Pavlov (for putting all the above together in LZMA), and Julian Seward (for bzip2's CLI). -Copyright (C) 2008-2014 Antonio Diaz Diaz. +Copyright (C) 2008-2015 Antonio Diaz Diaz. This file is free documentation: you have unlimited permission to copy, distribute and modify it. |