Home
last modified time | relevance | path

Searched refs:Huffman (Results 1 – 10 of 10) sorted by relevance

/freebsd-12.1/sys/contrib/zlib/doc/
H A Drfc1951.txt194 and Huffman coding. The Huffman trees for each block are independent
299 * Huffman codes are packed starting with the most-
313 3.2.1. Synopsis of prefix and Huffman coding
364 information on Huffman codes.)
372 3.2.2. Use of Huffman coding in the "deflate" format
517 01 - compressed with fixed Huffman codes
518 10 - compressed with dynamic Huffman codes
536 if compressed with dynamic Huffman codes
655 3.2.6. Compression with fixed Huffman codes (BTYPE=01)
745 encoded using the code length Huffman code
[all …]
H A Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/freebsd-12.1/sys/contrib/zstd/doc/
H A Dzstd_compression_format.md89 - [Huffman Coding](#huffman-coding)
442 using Huffman tree _from previous Huffman-compressed literals block_.
513 The format of the Huffman tree description can be found at [Huffman Tree description](#huffman-tree…
521 Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
914 FSE, and Huffman coding.
1078 Huffman Coding
1098 ### Huffman Tree Description
1158 ##### Huffman Tree header
1196 The Huffman header compression uses 2 states,
1237 ### Huffman-coded Streams
[all …]
/freebsd-12.1/sys/contrib/zstd/doc/educational_decoder/
H A DREADME.md11 It also contains implementations of Huffman and FSE table decoding.
/freebsd-12.1/contrib/file/magic/Magdir/
H A Dgeo29 # KEB D409-03167 V1.75 Huffman
H A Djpeg70 # Define Huffman Tables
H A Dcompress54 # packed data, Huffman (minimum redundancy) codes on a byte-by-byte basis
H A Dimages62 # Compressed color-mapped data, using Huffman, Delta, and runlength encoding
64 # Compressed color-mapped data, using Huffman, Delta, and RLE. 4-pass quadtree- type process
/freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/PDB/
H A DPDBTypes.h152 Huffman, enumerator
/freebsd-12.1/contrib/llvm/lib/DebugInfo/PDB/
H A DPDBExtras.cpp303 CASE_OUTPUT_ENUM_CLASS_NAME(PDB_SourceCompression, Huffman, OS) in operator <<()