mirror of
https://github.com/google/brotli.git
synced 2024-09-19 22:29:59 +00:00
Brotli compression format
c996c06e8d
If bit-orderings are to be parsed from left-to-right, then make the bit-strings left-justified. If bit-orderings are to be parsed from right-to-left, then make the bit-strings right-justified. Section 3.1, which describes how prefix codes work shows prefix codes that are "left-to-right", which is better for demonstrating how the work. However, most of the rest of the document uses a "right-to-left" convention. We should distinctly say at the end of section 3.1 that we are switching conventions. Thus, change the prefix code in section 3.5 to be "right-to-left" to be consistent with sections 9.1 and 9.2. Also, change the variable names in section 7.3 to be consistent with those used in section 10. Also, change the description of MNIBBLES to be "MNIBBLES - 4", similar to the convention of saying "MLEN - 1". Beforehand, the phrase "If MNIBBLES is 0, then ..." was unclear whether it meant MNIBBLES before the "plus 4" or after. |
||
|---|---|---|
| appveyor | ||
| dec | ||
| docs | ||
| enc | ||
| python | ||
| terryfy@8bb673f441 | ||
| tests | ||
| tools | ||
| .gitignore | ||
| .gitmodules | ||
| .travis.yml | ||
| appveyor.yml | ||
| CONTRIBUTING | ||
| LICENSE | ||
| README.md | ||
| setup.py | ||
| shared.mk | ||
brotli
Brotli is a generic-purpose lossless compression algorithm that compresses data using a combination of a modern variant of the LZ77 algorithm, Huffman coding and 2nd order context modeling, with a compression ratio comparable to the best currently available general-purpose compression methods. It is similar in speed with deflate but offers more dense compression.
The specification of the Brotli Compressed Data Format is defined in the following internet draft: http://www.ietf.org/id/draft-alakuijala-brotli
Brotli is open-sourced under the Apache License, Version 2.0, see the LICENSE file.
Brotli mailing list: https://groups.google.com/forum/#!forum/brotli