TY - JOUR
T1 - Improved variable-to-fixed length codes
AU - Klein, Shmuel T.
AU - Shapira, Dana
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2008/12/31
Y1 - 2008/12/31
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=58049093763&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-89097-3-6
DO - 10.1007/978-3-540-89097-3-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
VL - 5280 LNCS
SP - 39
EP - 50
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
T2 - 15th International Symposium on String Processing and Information Retrieval, SPIRE 2008
Y2 - 10 November 2008 through 12 November 2008
ER -