Lines Matching refs:code

62 The key question is how to represent a Huffman code (or any prefix code) so
68 input less than the length of longest code.  It gets that many bits from the
70 code is that many bits or less and how many, and if it is, it will tell
72 grabs more bits and tries to decode a longer code.
77 be a first level table to cover all the way to the longest code.  However,
86 those cases, the table ended up one bit longer than the ``average'' code
87 length, i.e. the code length of an approximately flat code which would be a
121 kbytes.  You can imagine that filling in a 2^15 entry table for a 15-bit code
123 other extreme, you could make a new table for every bit in the code.  In fact,
133 The code being decoded, with 10 symbols, from 1 to 6 bits long:
161 Table X is two bits long since the longest code starting with 110 is five bits
169 Table Y is three bits long since the longest code starting with 111 is six
184 entry table).  Assuming that the code ideally represents the probability of
192 indicates a base value and a number of bits to fetch after the code that is
193 added to the base value.  Or it might be the special end-of-block code.  The