Home
last modified time | relevance | path

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

/freebsd-14.2/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-14.2/sys/contrib/zstd/doc/
H A Dzstd_compression_format.md92 - [Huffman Coding](#huffman-coding)
475 using Huffman tree _from previous Huffman-compressed literals block_.
564 Reminder : Huffman compressed data consists of either 1 or 4 Huffman-coded streams.
1004 FSE, and Huffman coding.
1005 Huffman is used to compress literals,
1008 and to compress Huffman headers.
1182 Huffman Coding
1202 ### Huffman Tree Description
1265 #### Huffman Tree header
1353 ### Huffman-coded Streams
[all …]
/freebsd-14.2/sys/contrib/zstd/doc/educational_decoder/
H A DREADME.md11 It also contains implementations of Huffman and FSE table decoding.
/freebsd-14.2/contrib/file/magic/Magdir/
H A Dgeo29 # KEB D409-03167 V1.75 Huffman
H A Djpeg78 # Define Huffman Tables
H A 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
811 # compression method: 0~no 1~RLE 8-bit/pixel 3~Huffman 1D
812 #>>16 ulelong 3 \b, Huffman 1D compression
1011 # compression method: 0~no 1~RLE 8-bit/pixel 2~RLE 4-bit/pixel 3~Huffman 1D 6~RGBA bit field masks
1012 #>>>30 ulelong 3 \b, Huffman 1D compression
1110 # compression method: 0~no 3~Huffman 1D
1111 >>>30 ulelong 3 \b, Huffman 1D compression
1159 # compression method: 0~no 3~Huffman 1D
1160 >>>30 ulelong 3 \b, Huffman 1D compression
H A Dcompress131 # packed data, Huffman (minimum redundancy) codes on a byte-by-byte basis
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/
H A DPDBTypes.h161 Huffman, enumerator
/freebsd-14.2/contrib/llvm-project/llvm/lib/DebugInfo/PDB/
H A DPDBExtras.cpp344 CASE_OUTPUT_ENUM_CLASS_NAME(PDB_SourceCompression, Huffman, OS) in dumpPDBSourceCompression()
/freebsd-14.2/sys/contrib/zstd/lib/
H A DREADME.md111 implementation optimized for different scenarios. For example, the Huffman
/freebsd-14.2/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…