Abstract
This note modifies the data structure developed by Moffat and Turpin [3]. Besides reducing the memory requirement, the decoding algorithm is further improved. Experimental results demonstrate both the memory and decoding-time advantages of the modified method.
| Original language | English |
|---|---|
| Pages (from-to) | 341-345 |
| Number of pages | 5 |
| Journal | Journal of Information Science and Engineering |
| Volume | 17 |
| Issue number | 2 |
| Publication status | Published - 2001 Mar |
| Externally published | Yes |
Keywords
- Algorithm
- Canonical Huffman tree
- Compression
- Data structure
- Huffman decoding
ASJC Scopus subject areas
- Software
- Human-Computer Interaction
- Hardware and Architecture
- Library and Information Sciences
- Computational Theory and Mathematics