Abstract
Though many compression methods are based on the use of variable length codes, there has recently been a trend to search for alternatives in which the lengths of the codewords are more restricted, which can have useful applications, such as easier processing and fast decoding. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heuristics based on suffix trees, the performance of Tunstall codes can in some cases be improved by more than 40%.
Original language | English |
---|---|
Pages (from-to) | 777-785 |
Number of pages | 9 |
Journal | Information Processing and Management |
Volume | 47 |
Issue number | 5 |
DOIs | |
State | Published - Sep 2011 |
Keywords
- Data compression
- Huffman codes
- Suffix trees
- Tunstall codes