Home
last modified time | relevance | path

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

/freebsd-12-stable/sys/contrib/zlib/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
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-stable/sys/contrib/zstd/doc/
Dzstd_compression_format.md89 - [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…
[all …]
/freebsd-12-stable/sys/contrib/zstd/doc/educational_decoder/
DREADME.md11 It also contains implementations of Huffman and FSE table decoding.
/freebsd-12-stable/contrib/file/magic/Magdir/
Dgeo29 # KEB D409-03167 V1.75 Huffman
Djpeg78 # Define Huffman Tables
Dimages71 # Compressed color-mapped data, using Huffman, Delta, and runlength encoding
73 # Compressed color-mapped data, using Huffman, Delta, and RLE. 4-pass quadtree- type process
732 # compression method: 0~no 1~RLE 8-bit/pixel 3~Huffman 1D
733 #>>16 ulelong 3 \b, Huffman 1D compression
932 # compression method: 0~no 1~RLE 8-bit/pixel 2~RLE 4-bit/pixel 3~Huffman 1D 6~RGBA bit field masks
933 #>>>30 ulelong 3 \b, Huffman 1D compression
1031 # compression method: 0~no 3~Huffman 1D
1032 >>>30 ulelong 3 \b, Huffman 1D compression
1080 # compression method: 0~no 3~Huffman 1D
1081 >>>30 ulelong 3 \b, Huffman 1D compression
Dcompress125 # packed data, Huffman (minimum redundancy) codes on a byte-by-byte basis
/freebsd-12-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/
DPDBTypes.h161 Huffman, enumerator
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/PDB/
DPDBExtras.cpp341 CASE_OUTPUT_ENUM_CLASS_NAME(PDB_SourceCompression, Huffman, OS) in dumpPDBSourceCompression()