* Compresses data with efficiency comparable to the bestД¬urrently available general-purpose compression methods,ДЄnd in particular considerably better than the 'compress' Priori bounded amount of intermediate storage, and henceД¬an be used in data communications or similar structures Sequentially presented input data stream, using only an a * Can be produced or consumed, even for an arbitrarily long * Is independent of CPU type, operating system, file system,ДЄnd character set, and hence can be used for interchange The purpose of this specification is to define a lossless Compression with dynamic Huffman codes (BTYPE=10). Compression with fixed Huffman codes (BTYPE=01). Compressed blocks (length and distance codes). Use of Huffman coding in the 'deflate' format. Definitions of terms and conventions used. RFC 1951 DEFLATE Compressed Data Format Specification May 1996ДЎ. The format can be implemented readily in a manner not The data can be produced orД¬onsumed, even for an arbitrarily long sequentially presented inputДata stream, using only an a priori bounded amount of intermediate This specification defines a lossless compressed data format thatД¬ompresses data using a combination of the LZ77 algorithm and HuffmanД¬oding, with efficiency comparable to the best currently available Substantive changes or deletions from the original are clearlyДЄ pointer to the latest version of this and related documentation in Languages and incorporation into compilations, provided that theД¬opyright notice and this notice are preserved, and that any

Purpose and without charge, including translations into other

Permission is granted to copy and distribute this document for any Property Rights statements contained in this document. The IESG takes no position on the validity of any Intellectual This memoДoes not specify an Internet standard of any kind. This memo provides information for the Internet community. Request for Comments: 1951 Aladdin EnterprisesДEFLATE Compressed Data Format Specification version 1.3

Final Data 3 0