| commit | 5c869c9de2b1cc7afd86b8e03f0c3d6763034ee2 | [log] [tgz] |
|---|---|---|
| author | Joe Tsai <joetsai@digital-static.net> | Sun Nov 01 17:01:38 2015 -0800 |
| committer | Joe Tsai <joetsai@digital-static.net> | Sun Nov 01 17:01:38 2015 -0800 |
| tree | 4108626f00b905ff056e70817efe0c8109cf51ba | |
| parent | c5b6b5c7c17fc639251bb6bc5cddd5c5a1d1dc1b [diff] |
Clarify simple and complex prefix codes * At the beginning of the simple prefix code section, telling us that "a value of 1 indicates the number of leading zeros" is not very helpful. Instead, it should indicate that it means a complex prefix code and point the reader to the relevant section (which repeats this information in more detail) * Clearly indicate that reusing a value is an error! This seems to be the behavior of the of the reference implementation. * Clarify what the termination conditions are while reading the prefix codes. Also, indicate that it is an error if the prefix tree is over-subscribed or under-subscribed. * Clearly state what is the maximum number of individual symbols that may be read. This ensures that it is forbidden to an stream that continually says that the symbols have zero length.
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