t).  Such a code is called a Huffman code.  (See
         reference [<a href="#ref-1" title="&quot;A Method for the Construction of Minimum Redundancy Codes&quot;">1</a>] in Chapter 5, references for additional
         information on Huffman codes.)

         Note that in the "deflate" format, the Huffman codes for the
         various alphabets must not exceed certain maximum code lengths.
         This constraint complicates the algorithm for computing code
         lengths from symbol frequencies.  Agai