Lines Matching refs:Huffman

89   - [Huffman Coding](#huffman-coding)
404 Literals can be stored uncompressed or compressed using Huffman prefix codes.
438 - `Compressed_Literals_Block` - This is a standard Huffman-compressed block,
439         starting with a Huffman tree description.
441 - `Treeless_Literals_Block` - This is a Huffman-compressed block,
442         using Huffman tree _from previous Huffman-compressed literals block_.
444         Note: If this mode is triggered without any previous Huffman-table in the frame
496 Note: `Compressed_Size` __includes__ the size of the Huffman Tree description
508 Both of these modes contain Huffman encoded data.
513 The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree…
519 the Huffman table comes from previously compressed literals block.
521 Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
525 [Huffman-Coded Streams](#huffman-coded-streams).
543 Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
544 as described at [Huffman-Coded Streams](#huffman-coded-streams)
914 FSE, and Huffman coding.
1078 Huffman Coding
1080 Zstandard Huffman-coded streams are read backwards,
1083 know the offset of the last byte of the Huffman-coded stream.
1095 The bitstream contains Huffman-coded symbols in __little-endian__ order,
1098 ### Huffman Tree Description
1107 the Huffman algorithm allows the construction of an optimal prefix code
1129 Let's presume the following Huffman tree must be described :
1158 ##### Huffman Tree header
1179 ##### Finite State Entropy (FSE) compression of Huffman weights
1181 In this case, the series of Huffman weights is compressed using FSE compression.
1193 For a list of Huffman weights, the maximum accuracy log is 7 bits.
1196 The Huffman header compression uses 2 states,
1210 ##### Conversion from weights to Huffman prefix codes
1237 ### Huffman-coded Streams
1238 Given a Huffman decoding table,
1239 it's possible to decode a Huffman-coded stream.
1317               and [Huffman](#huffman-tree-description) sections for how to decode these tables.
1319               Huffman tables for literals, FSE table for offsets,
1533 - 0.1.2 : limit Huffman tree depth to 11 bits