Lines Matching refs:compressed

42    This specification defines a lossless compressed data format that
80           3.2.4. Non-compressed blocks (BTYPE=00) ................... 11
97       compressed data format that:
126           * Allow random access to compressed data;
189    A compressed data set consists of a series of blocks, corresponding
193    Each block is compressed using a combination of the LZ77 algorithm
200    describe the representation of the compressed data part, and a
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
215    the compressed data for that block.
287          bit-oriented.  However, we describe the compressed block format
291          compressed byte sequence:
302          In other words, if one were to print out the compressed data as
492          Each block of compressed data begins with 3 header bits
514          BTYPE specifies how the data are compressed, as follows:
517             01 - compressed with fixed Huffman codes
518             10 - compressed with dynamic Huffman codes
521          The only difference between the two compressed cases is how the
536                   if compressed with dynamic Huffman codes
576       3.2.4. Non-compressed blocks (BTYPE=00)
682          occur in the compressed data, but participate in the code
688          31 will never actually occur in the compressed data.
694          compressed data, first the literal/length code and then the
698          compressed using a Huffman code.  The alphabet for code lengths
750                The actual compressed data of the block,
776    compressed data format without reference to any particular
777    compression algorithm, the format is related to the compressed
878    means of validating the integrity of the compressed data.  See