diff options
| author | Julian Seward <jseward@acm.org> | 1997-08-29 22:13:13 +0200 |
|---|---|---|
| committer | Julian Seward <jseward@acm.org> | 1997-08-29 22:13:13 +0200 |
| commit | 1eb67a9d8f7f05ae310bc9ef297d176f3a3f8a37 (patch) | |
| tree | 7320c524e6eca96193adda97d2cdb5d76d57920a /bzip2.1 | |
| parent | 33d134030248633ffa7d60c0a35a783c46da034b (diff) | |
| download | bzip2-0.1pl2.tar.gz bzip2-0.1pl2.tar.bz2 bzip2-0.1pl2.zip | |
bzip2-0.1pl2bzip2-0.1pl2
Diffstat (limited to '')
| -rw-r--r-- | bzip2.1 | 3 | ||||
| -rw-r--r-- | bzip2.1.preformatted | 3 |
2 files changed, 6 insertions, 0 deletions
| @@ -406,6 +406,9 @@ helpful to at least allow | |||
| 406 | to decompress files created by 0.21, but this would | 406 | to decompress files created by 0.21, but this would |
| 407 | defeat the primary aim of having a patent-free compressor. | 407 | defeat the primary aim of having a patent-free compressor. |
| 408 | 408 | ||
| 409 | For a more precise statement about patent issues in | ||
| 410 | bzip2, please see the README file in the distribution. | ||
| 411 | |||
| 409 | Huffman coding necessarily involves some coding inefficiency | 412 | Huffman coding necessarily involves some coding inefficiency |
| 410 | compared to arithmetic coding. This means that | 413 | compared to arithmetic coding. This means that |
| 411 | .I bzip2 | 414 | .I bzip2 |
diff --git a/bzip2.1.preformatted b/bzip2.1.preformatted index 947dc97..5206e05 100644 --- a/bzip2.1.preformatted +++ b/bzip2.1.preformatted | |||
| @@ -425,6 +425,9 @@ RREELLAATTIIOONNSSHHIIPP TTOO bbzziipp--00..2211 | |||
| 425 | to decompress files created by 0.21, but this would defeat | 425 | to decompress files created by 0.21, but this would defeat |
| 426 | the primary aim of having a patent-free compressor. | 426 | the primary aim of having a patent-free compressor. |
| 427 | 427 | ||
| 428 | For a more precise statement about patent issues in bzip2, | ||
| 429 | please see the README file in the distribution. | ||
| 430 | |||
| 428 | Huffman coding necessarily involves some coding ineffi- | 431 | Huffman coding necessarily involves some coding ineffi- |
| 429 | ciency compared to arithmetic coding. This means that | 432 | ciency compared to arithmetic coding. This means that |
| 430 | _b_z_i_p_2 compresses about 1% worse than 0.21, an unfortunate | 433 | _b_z_i_p_2 compresses about 1% worse than 0.21, an unfortunate |
