Home
last modified time | relevance | path

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

12

/netbsd-src/external/gpl3/binutils/dist/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.
/netbsd-src/external/gpl3/binutils.old/dist/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.
/netbsd-src/external/gpl3/gdb.old/dist/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.
/netbsd-src/external/gpl3/gdb/dist/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.
/netbsd-src/common/dist/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 …]
/netbsd-src/external/gpl3/gdb/dist/zlib/examples/
H A DREADME.examples7 construction over all possible Huffman codes
/netbsd-src/external/gpl3/binutils.old/dist/zlib/examples/
H A DREADME.examples7 construction over all possible Huffman codes
/netbsd-src/common/dist/zlib/examples/
H A DREADME.examples7 construction over all possible Huffman codes
/netbsd-src/external/gpl3/binutils/dist/zlib/examples/
H A DREADME.examples7 construction over all possible Huffman codes
/netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/
H A D2000-12-06-MeetingSummary.txt79 C. Use something similar to Huffman encoding, so that the most common
/netbsd-src/external/bsd/file/dist/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
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/
H A DPDBTypes.h161 Huffman, enumerator
/netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/
H A DPDBExtras.cpp341 CASE_OUTPUT_ENUM_CLASS_NAME(PDB_SourceCompression, Huffman, OS) in dumpPDBSourceCompression()
/netbsd-src/external/public-domain/xz/dist/doc/
H A Dfaq.txt111 the final bitstream like Huffman coding is used in Deflate.
/netbsd-src/external/gpl3/gcc/dist/libbacktrace/
H A DChangeLog1083 function to produce fixed Huffman table.
/netbsd-src/external/historical/nawk/dist/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…
/netbsd-src/etc/
H A Dservices19274 # [Amber_Huffman] Amber Huffman …
20249 # [David_Huffman] David Huffman …
/netbsd-src/share/misc/
H A Dzipcodes34041 77336:Huffman, TX

12