.png){kind=icon}
.png){kind=icon}
Return
On improving Tunstall codes
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ipm.2011.01.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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%. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Data compression
Huffman codes
Tunstall codes
Suffix trees
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
6.9
Papers:
5.2K
Citations:
1.4W