Deflate Algorithm
Jump to navigation
Jump to search
A Deflate Algorithm is a Dictionary Encoding Algorithm that is based on LZSS and Huffman coding algorithms.
- Context:
- Example(s):
- Counter-Example(s):
- See: ZIP (File Format), Computing, Lossless Compression, Data Compression, File Format, Huffman Coding, PKZIP, Internet Engineering Task Force, PKWARE.
References
2021
- (Wikipedia, 2021) ⇒ https://en.wikipedia.org/wiki/Deflate Retrieved:2021-5-2.
- In computing, Deflate is a lossless data compression file format that uses a combination of LZSS and Huffman coding. It was designed by Phil Katz, for version 2 of his PKZIP archiving tool. Deflate was later specified in RFC 1951 (1996).[1]
Katz also designed the original algorithm used to construct Deflate streams. This algorithm was patented as , and assigned to PKWARE, Inc.[2] As stated in the RFC document, an algorithm producing Deflate files was widely thought to be implementable in a manner not covered by patents. This led to its widespread use – for example, in gzip compressed files and PNG image files, in addition to the ZIP file format for which Katz originally designed it. The patent has since expired.
- In computing, Deflate is a lossless data compression file format that uses a combination of LZSS and Huffman coding. It was designed by Phil Katz, for version 2 of his PKZIP archiving tool. Deflate was later specified in RFC 1951 (1996).[1]
- ↑ Deutsch, L. Peter (May 1996). DEFLATE Compressed Data Format Specification version 1.3. IETF. p. 1. sec. Abstract. doi:10.17487/RFC1951. RFC 1951. Retrieved 2014-04-23.
- ↑ US patent 5051745, Katz, Phillip W., "String Searcher, and Compressor Using Same", published 1991-09-24, issued 1991-09-24
1996
- (Deutsch, 1996) ⇒ L. Peter Deutsch (1996). DEFLATE Compressed Data Format Specification version 1.3.
- QUOTE: This specification defines a lossless compressed data format that compresses data using a combination of the LZ77 algorithm and Huffman coding, with efficiency comparable to the best currently available general-purpose compression methods. The data can be produced or consumed, even for an arbitrarily long sequentially presented input data stream, using only an a priori bounded amount of intermediate storage. The format can be implemented readily in a manner not covered by patents.