Lines Matching refs:Huffman

92   - [Huffman Coding](#huffman-coding)
422 - The previous Huffman tree, required by `Treeless_Literals_Block` type
429 - The Huffman tree comes from the previous `Compressed_Literals_Block`.
437 Literals can be stored uncompressed or compressed using Huffman prefix codes.
471 - `Compressed_Literals_Block` - This is a standard Huffman-compressed block,
472         starting with a Huffman tree description.
474 - `Treeless_Literals_Block` - This is a Huffman-compressed block,
475         using Huffman tree _from previous Huffman-compressed literals block_.
477         Note: If this mode is triggered without any previous Huffman-table in the frame
534 Note: `Compressed_Size` __includes__ the size of the Huffman Tree description
546 Both of these modes contain Huffman encoded data.
549 the Huffman table comes from previously compressed literals block,
555 The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree…
562 The Jump Table is only present when there are 4 Huffman-coded streams.
564 Reminder : Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
568 [Huffman-Coded Streams](#huffman-coded-streams).
587 Each of these 4 bitstreams is then decoded independently as a Huffman-Coded stream,
588 as described at [Huffman-Coded Streams](#huffman-coded-streams)
1004 FSE, and Huffman coding.
1005 Huffman is used to compress literals,
1008 and to compress Huffman headers.
1182 Huffman Coding
1184 Zstandard Huffman-coded streams are read backwards,
1187 know the offset of the last byte of the Huffman-coded stream.
1199 The bitstream contains Huffman-coded symbols in __little-endian__ order,
1202 ### Huffman Tree Description
1212 the Huffman algorithm allows the construction of an optimal prefix code
1235 Let's presume the following Huffman tree must be described :
1265 #### Huffman Tree header
1294 #### Finite State Entropy (FSE) compression of Huffman weights
1296 In this case, the series of Huffman weights is compressed using FSE compression.
1308 For a list of Huffman weights, the maximum accuracy log is 6 bits.
1311 The Huffman header compression uses 2 states,
1325 #### Conversion from weights to Huffman prefix codes
1353 ### Huffman-coded Streams
1355 Given a Huffman decoding table,
1356 it's possible to decode a Huffman-coded stream.
1438               and [Huffman](#huffman-tree-description) sections for how to decode these tables.
1440               Huffman tables for literals, FSE table for offsets,
1690 - 0.1.2 : limit Huffman tree depth to 11 bits