This is about the simplest compression algorithm.
Imagine you have an image with three-byte colors (white and green) that are:
WWWWWWWWWWWWWGGGGGGGGWWWWWWWWWW
You could represent that in a shorter fashion with:
13W8G10W
David Huffman invented Huffman coding in 1951 as a final project while taking a class at MIT. Huffman coding uses a binary tree to track the most frequently used data patterns in a set of data.
LZ77 was an algorithm invented by Abraham Lempel and Jacob Ziv and published in 1977, which uses a dictionary coder. A dictionary coder has a dictionary of symbols to represent frequently used patterns in the data. LZSS is a later revision of the original LZ77 algorithm.
Deflate is a file format that divides data into blocks. Blocks can be uncompressed, compressed with Huffman coding, or compressed with LZSS.
(Not all data can be compressed, particularly data that is already compressed.)
735 KB (753,125 bytes)
187 KB (191,756 bytes)
61.3 KB (62,849 bytes)
Emulators like:
vt100
OpenVMS
xterm