Lines Matching full:compressed
12 DEFLATE Compressed Data Format Specification version 1.3
42 This specification defines a lossless compressed data format that
61 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
73 2. Compressed representation overview ............................. 4
77 3.2. Compressed block format ................................... 6
81 3.2.4. Non-compressed blocks (BTYPE=00) ................... 11
82 3.2.5. Compressed blocks (length and distance codes) ...... 11
98 compressed data format that:
118 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
128 * Allow random access to compressed data;
175 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
190 2. Compressed representation overview
192 A compressed data set consists of a series of blocks, corresponding
196 Each block is compressed using a combination of the LZ77 algorithm
203 describe the representation of the compressed data part, and a
204 compressed data part. (The Huffman trees themselves are compressed
205 using Huffman encoding.) The compressed data consists of a series of
215 compressed data is represented using a Huffman code, using one code
218 the compressed data for that block.
232 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
289 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
292 bit-oriented. However, we describe the compressed block format
296 compressed byte sequence:
307 In other words, if one were to print out the compressed data as
316 3.2. Compressed block format
346 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
403 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
460 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
500 Each block of compressed data begins with 3 header bits
517 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
523 BTYPE specifies how the data are compressed, as follows:
526 01 - compressed with fixed Huffman codes
527 10 - compressed with dynamic Huffman codes
530 The only difference between the two compressed cases is how the
545 if compressed with dynamic Huffman codes
574 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
586 3.2.4. Non-compressed blocks (BTYPE=00)
599 3.2.5. Compressed blocks (length and distance codes)
631 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
688 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
694 occur in the compressed data, but participate in the code
700 31 will never actually occur in the compressed data.
706 compressed data, first the literal/length code and then the
710 compressed using a Huffman code. The alphabet for code lengths
745 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
763 The actual compressed data of the block,
789 compressed data format without reference to any particular
790 compression algorithm, the format is related to the compressed
802 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
859 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
893 means of validating the integrity of the compressed data. See
916 RFC 1951 DEFLATE Compressed Data Format Specification May 1996
