Lines Matching refs:alphabet

316          alphabet by bit sequences (codes), one code for each symbol, in
324          labeled with) the symbols of the alphabet; then the code for a
358          Given an alphabet with known symbol frequencies, the Huffman
362          alphabet).  Such a code is called a Huffman code.  (See
374          The Huffman codes used for each alphabet in the "deflate"
400          follows, assuming that the order of the alphabet is ABCD:
412          Given this rule, we can define the Huffman code for an alphabet
414          the alphabet in order; this is sufficient to determine the
459          Consider the alphabet ABCDEFGH, with bit lengths (3, 3, 3, 3,
593          distinct alphabets: either literal bytes, from the alphabet of
597          alphabets are merged into a single alphabet (0..285), where
659          for the literal/length alphabet are:
698          compressed using a Huffman code.  The alphabet for code lengths
714          the literal/length or distance alphabet will not occur in the
736                   alphabet given just above, in the order: 16, 17, 18,
744                HLIT + 257 code lengths for the literal/length alphabet,
747                HDIST + 1 code lengths for the distance alphabet,