next up previous
Next: Lempel-Ziv-Welch (LZW) Algorithm Up: Lossless Compression Algorithms (Entropy Previous: Adaptive Huffman Coding

Arithmetic Coding

Huffman coding and the like use an integer number (k) of bits for each symbol, hence k is never less than 1. Sometimes, e.g., when sending a 1-bit image, compression becomes impossible.


next up previous
Next: Lempel-Ziv-Welch (LZW) Algorithm Up: Lossless Compression Algorithms (Entropy Previous: Adaptive Huffman Coding
Dave Marshall
10/4/2001