Home
last modified time | relevance | path

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

/freebsd/sys/contrib/zlib/doc/
H A 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 …]
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/sys/contrib/zstd/doc/
H A Dzstd_compression_format.md92 - [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
[all …]
/freebsd/sys/contrib/zstd/doc/educational_decoder/
H A DREADME.md11 It also contains implementations of Huffman and FSE table decoding.
/freebsd/contrib/file/magic/Magdir/
H A Dgeo29 # KEB D409-03167 V1.75 Huffman
H A Djpeg78 # Define Huffman Tables
H A Dimages80 # Compressed color-mapped data, using Huffman, Delta, and runlength encoding
82 # Compressed color-mapped data, using Huffman, Delta, and RLE. 4-pass quadtree- type process
847 # compression method: 0~no 1~RLE 8-bit/pixel 3~Huffman 1D
848 #>>16 ulelong 3 \b, Huffman 1D compression
1047 # compression method: 0~no 1~RLE 8-bit/pixel 2~RLE 4-bit/pixel 3~Huffman 1D 6~RGBA bit field masks
1048 #>>>30 ulelong 3 \b, Huffman 1D compression
1146 # compression method: 0~no 3~Huffman 1D
1147 >>>30 ulelong 3 \b, Huffman 1D compression
1195 # compression method: 0~no 3~Huffman 1D
1196 >>>30 ulelong 3 \b, Huffman 1D compression
H A Dcompress131 # packed data, Huffman (minimum redundancy) codes on a byte-by-byte basis
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/
H A DPDBTypes.h161 Huffman, enumerator
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/
H A DPDBExtras.cpp348 CASE_OUTPUT_ENUM_CLASS_NAME(PDB_SourceCompression, Huffman, OS) in dumpPDBSourceCompression()
/freebsd/sys/contrib/zstd/lib/
H A DREADME.md111 implementation optimized for different scenarios. For example, the Huffman
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.in16895 …ompression of numbers; data handling; decimal data; decoding; deletions; Huffman codes; insertions…
19350 …-- Subroutines; data file compaction; data processing; decoder; encoder; Huffman codes; N-gram enc…
22649 …e is presented, which can reduce program size by a factor of 3. Unlike a Huffman code, which utili…