Table 5 Decoding performance of the proposed method and regular Huffman-based Technique
From: Balancing decoding speed and memory usage for Huffman codes using quaternary tree
S/N | Source file | File size (bytes) | Time (ms) | Enhancement rate over regular binary ((RH − QH) * 100)/RH | |
|---|---|---|---|---|---|
Quaternary Huffman (QH) | Regular Huffman-based techniques (RH) (Chowdhury et al. 2002) | ||||
1 | Quaternary-source.txt | 9861 | 3 | 7 | 57.14 |
2 | Quaternary-license.txt | 18,651 | 6 | 12 | 50.00 |
3 | Lgpl-2.1.txt | 27,032 | 7 | 16 | 56.25 |
4 | The-matrix-transcript.txt | 46,836 | 12 | 27 | 55.56 |