Abstract
New variants of partial decoding tables are presented that can be used to accelerate the decoding of texts compressed by any prefix code, such as Huffman's. They are motivated by a variety of tradeoffs between decompression speed and required auxiliary space, and apply to any shape of the tree, not only the canonical one. Performance is evaluated both analytically and by experiments, showing that the necessary tables can be reduced drastically, with hardly any loss in performance.
| Original language | English |
|---|---|
| Pages (from-to) | 143-152 |
| Number of pages | 10 |
| Journal | Proceedings of the Data Compression Conference |
| State | Published - 2005 |
| Event | DCC 2005: Data Compression Conference - Snowbird, UT, United States Duration: 29 Mar 2005 → 31 Mar 2005 |