Lines Matching full:codes

81           3.2.5. Compressed blocks (length and distance codes) ...... 11
82           3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83           3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
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
316          alphabet by bit sequences (codes), one code for each symbol, in
361          using the fewest bits of any possible prefix codes for that
364          information on Huffman codes.)
366          Note that in the "deflate" format, the Huffman codes for the
374          The Huffman codes used for each alphabet in the "deflate"
377              * All codes of a given bit length have lexicographically
381              * Shorter codes lexicographically precede longer codes.
413          just by giving the bit lengths of the codes for each symbol of
415          actual codes.  In our example, the code is completely defined
417          algorithm generates the codes as integers, intended to be read
419          initially in tree[I].Len; the codes are produced in
422          1)  Count the number of codes for each code length.  Let
423              bl_count[N] be the number of codes of length N, N >= 1.
435          3)  Assign numerical values to all codes, using consecutive
436              values for all codes of the same length with the base
437              values determined at step 2. Codes that are never used
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
589       3.2.5. Compressed blocks (length and distance codes)
599          end-of-block, and values 257..285 represent length 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
661                    Lit Value    Bits        Codes
679          The code lengths are sufficient to generate the actual codes,
680          as described above; we show the codes in the table for added
685          Distance codes 0-31 are represented by (fixed-length) 5-bit
686          codes, with possible additional bits as shown in the table
687          shown in Paragraph 3.2.5, above.  Note that distance codes 30-
690       3.2.7. Compression with dynamic Huffman codes (BTYPE=10)
692          The Huffman codes for the two alphabets appear in the block
705                           Example:  Codes 8, 16 (+2 bits 11),
720          distance codes used at all (the data is all literals).
724                5 Bits: HLIT, # of Literal/Length codes - 257 (257 - 286)
725                5 Bits: HDIST, # of Distance codes - 1        (1 - 32)
726                4 Bits: HCLEN, # of Code Length codes - 4     (4 - 19)
752                   codes
757          The code length repeat codes can cross from HLIT + 257 to the
850        Redundancy Codes", Proceedings of the Institute of Radio
866    [6] Hirschberg and Lelewer, "Efficient decoding of prefix codes,"