Lines Matching refs:Huffman

43    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
212    compressed data is represented using a Huffman code, using one code
296              * Data elements other than Huffman codes are packed
299              * Huffman codes are packed starting with the most-
307          elements in the correct MSB-to-LSB order and Huffman codes in
313       3.2.1. Synopsis of prefix and Huffman coding
358          Given an alphabet with known symbol frequencies, the Huffman
362          alphabet).  Such a code is called a Huffman code.  (See
364          information on Huffman codes.)
366          Note that in the "deflate" format, the Huffman codes for the
372       3.2.2. Use of Huffman coding in the "deflate" format
374          The Huffman codes used for each alphabet in the "deflate"
412          Given this rule, we can define the Huffman code for an alphabet
517             01 - compressed with fixed Huffman codes
518             10 - compressed with dynamic Huffman codes
522          Huffman codes for the literal/length and distance alphabets are
536                   if compressed with dynamic Huffman codes
655       3.2.6. Compression with fixed Huffman codes (BTYPE=01)
657          The Huffman codes for the two alphabets are fixed, and are not
658          represented explicitly in the data.  The Huffman code lengths
690       3.2.7. Compression with dynamic Huffman codes (BTYPE=10)
692          The Huffman codes for the two alphabets appear in the block
698          compressed using a Huffman code.  The alphabet for code lengths
715          block, and should not participate in the Huffman code
745                   encoded using the code length Huffman code
748                   encoded using the code length Huffman code
751                   encoded using the literal/length and distance Huffman
755                   encoded using the literal/length Huffman code
813    Huffman encoding.  The hash chains are singly linked. There are no
849    [1] Huffman, D. A., "A Method for the Construction of Minimum