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 be useful for fast decoding and compressed searches. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using a new heuristic based on suffix trees, the performance of Tunstall codes could be improved by more than 30%. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Klein, S. T., & Shapira, D. (2008). Improved variable-to-fixed length codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5280 LNCS, pp. 39–50). Springer Verlag. https://doi.org/10.1007/978-3-540-89097-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
