Abstract
In recent publications about data compression, arithmetic codes are often suggested as the state of the art, rather than the more popular Huffman codes. While it is true that Huffman codes are not optimal in all situations, we show that the advantage of arithmetic codes in compression performance is often negligible. Referring also to other criteria, we conclude that for many applications, Huffman codes should still remain a competitive choice.
| Original language | English |
|---|---|
| Pages (from-to) | 279-296 |
| Number of pages | 18 |
| Journal | Computing (Vienna/New York) |
| Volume | 50 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1993 |
Keywords
- Data compression
- Huffman codes
- arithmetic codes
- cooling theory
- information storage
- text compression