Abstract
A standard way of implementing Huffman's optimal code construction algorithm is by using a sorted sequence of frequencies. Several aspects of the algorithm are investigated as to the consequences of relaxing the requirement of keeping the frequencies in order. Using only partial order may speed up the code construction, which is important in some applications, at the cost of increasing the size of the encoded file.
Original language | English |
---|---|
Pages (from-to) | 171-178 |
Number of pages | 8 |
Journal | Mathematics in Computer Science |
Volume | 5 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2011 |
Keywords
- Burrows-Wheler transform
- Data compression
- Dynamic compression
- Huffman coding
- Partial sorting