: 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. 1. Introduction It is paradoxical that, as the technology for storing and transmitting information has gotten cheaper and more effective, interest in data compression has increased. There are many explanations, but most conspicuous is that improvements in media have expanded our sense of what we wish to store. For example, CD-Rom technology allows us to store whole libraries instead of records describing individual items; but the requirements of storing full text easily exceeds the capabilities even of the optical format. Similarly, there is ...
|
799
|
A universal algorithm for sequential data compression
– Ziv, Lempel
- 1977
|
|
613
|
A method for the construction of minimum-redundancy codes
– Huffman
- 1952
|
|
515
|
Compression of individual sequences via variable-rate coding
– Ziv, Lempel
- 1978
|
|
229
|
Universal codeword sets and representation of the integers
– Elias
- 1975
|
|
151
|
Arithmetic coding
– Langdon
- 1979
|
|
108
|
Information Theory and Coding
– Abramson
- 1963
|
|
83
|
Variations on a theme by Huffman
– Gallager
- 1978
|
|
83
|
Information Retrieval - Computational and Theoretical Aspects
– Heaps
- 1978
|
|
81
|
Dynamic Huffman coding
– Knuth
- 1985
|
|
72
|
Generalized Kraft Inequality and Arithmetic Coding
– Rissanen
- 1976
|
|
68
|
Adding compression to a full-text retrieval system
– Zobel, Moffat
- 1995
|
|
68
|
Data compression
– Lelewer, Hirschberg
- 1987
|
|
65
|
The design and analysis of dynamic huffman codes
– Vitter
- 1987
|
|
64
|
The Art of Computer Programming vol. Fundamental Algorithms
– Knuth
- 1973
|
|
63
|
The data compression book
– Nelson
- 1992
|
|
36
|
Self-synchronizing huffman codes
– Ferguson, Rabinowitz
- 1984
|
|
33
|
Variable-length binary encodings
– Gilbert, Moore
- 1959
|
|
32
|
A fast algorithm for optimal length-limited Huffman codes
– Larmore, Hirschberg
- 1990
|
|
30
|
On the construction of huffman trees
– Leeuwen
- 1976
|
|
28
|
Generating a canonical prefix encoding
– Schwartz, Kallick
- 1964
|
|
27
|
Efficient Decoding of Prefix Codes
– Hirschberg, Lelewer
- 1990
|
|
24
|
Bounds on the redundancy of Huffman codes
– Capocelli, Giancarlo, et al.
- 1986
|
|
17
|
A systematic approach to compressing a full-text ret,rieval system
– Bookstein, Klein, et al.
- 1992
|
|
17
|
Codes based on inaccurate source probabilities
– Gilbert
- 1971
|
|
15
|
Bounding the depth of search trees
– Fraenkel, Klein
- 1993
|
|
15
|
Cryptanalysis: A Study of Ciphers and Their Solutions
– Gaines
- 1956
|
|
15
|
An empirical evaluation of coding methods for multi-symbol alphabets
– Moffat, Sharman, et al.
- 1994
|
|
13
|
Efficient variants of Huffman codes in high level languages
– Choueka, Klein, et al.
- 1985
|
|
11
|
about the Responsa Retrieval Project you always wanted to know but were afraid to ask, Expanded Summary
– Fraenkel, All
- 1976
|
|
9
|
Storing Text Retrieval Systems on CD-ROM
– Klein, Bookstein, et al.
- 1989
|
|
8
|
Compression, Information Theory and Grammars: A Unified Approach
– Bookstein, Klein
- 1990
|
|
8
|
Novel compression of sparse bit-strings
– Fraenkel, Klein
- 1985
|
|
8
|
The Advanced Theory of Language as Choice and Chance
– Herdan
- 1966
|
|
7
|
Huffman coding in bit-vector compression
– Jakobsson
- 1978
|
|
6
|
Piecewise arithmetic coding
– Teuhola, Raita
- 1991
|
|
5
|
Models of Bitmap Generation: A Systematic Approach to Bitmap
– Bookstein, Klein
- 1992
|
|
4
|
Cleary J.G., Arithmetic coding for data compression
– Witten, Neal
- 1987
|
|
2
|
Eine einfuhrende Ubersicht, Erster Teil
– Bauer, Goos, et al.
- 1973
|
|
2
|
Raita T., Ravichandra Rao I.K., Patil M.D., Can random fluctuations be exploited in data compression
– Bookstein, Klein
- 1993
|
|
2
|
Taneja I.J., Bounds on the redundancy of Huffman codes
– Capocelli, Giancarlo
- 1986
|
|
2
|
Walach A.C., High efficiency, multiplication free approximation of arithmetic coding
– Chevion, Karnin
- 1991
|
|
2
|
Vitter J.S., Practical implementations of arithmetic coding
– Howard
- 1992
|
|
2
|
inflexions and their letter and syllable structure in Finnish newspaper text, Research Rep
– Pesonen, Word
|
