Name
Abstract | ||
|---|---|---|
Huffman coding is known to be optimal, yet its dynamic version may yield smaller compressed files. The best known bound is that the number of bits used by dynamic Huffman coding in order to encode a message of n characters is at most larger by n bits than the size of the file required by static Huffman coding. In particular, dynamic Huffman coding can also generate a larger encoded file than the static variant, though in practice the file might sometimes be smaller. We propose here a new variant of Huffman encoding, that provably always performs better than static Huffman coding by at least m − 1 bits, where m denotes the size of the alphabet, and may be better than the standard dynamic Huffman coding for certain files. The algorithm is based on reversing the direction for the references of the encoded elements, from pointing backwards into the past to looking forward into the future. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s00224-020-09992-7 | Theory of Computing Systems |
Keywords | DocType | Volume |
Lossless data compression, Huffman coding, Dynamic Huffman coding | Journal | 65 |
Issue | ISSN | Citations |
3 | 1432-4350 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shmuel T. Klein | 1 | 434 | 77.80 |
| Shoham Saadia | 2 | 1 | 0.36 |
| Dana Shapira | 3 | 144 | 32.15 |