Improved variable-to-fixed length codes

Shmuel T. Klein; Dana Shapira

doi:10.1007/978-3-540-89097-3_6

Improved variable-to-fixed length codes

Shmuel T. Klein, Dana Shapira

Department of Computer Science

Ashkelon Academic College

Research output: Contribution to journal › Conference article › peer-review

11 Scopus citations

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%.

Original language	English
Pages (from-to)	39-50
Number of pages	12
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5280 LNCS
DOIs	https://doi.org/10.1007/978-3-540-89097-3_6
State	Published - 2008
Event	15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 - Melbourne. VIC, Australia Duration: 10 Nov 2008 → 12 Nov 2008

Access to Document

10.1007/978-3-540-89097-3_6

Cite this

@article{4dd844365b5a4114bf467fa88d54230b,

title = "Improved variable-to-fixed length codes",

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%.",

author = "Klein, {Shmuel T.} and Dana Shapira",

year = "2008",

doi = "10.1007/978-3-540-89097-3_6",

language = "אנגלית",

volume = "5280 LNCS",

pages = "39--50",

journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

issn = "0302-9743",

publisher = "Springer Verlag",

note = "15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 ; Conference date: 10-11-2008 Through 12-11-2008",

}

TY - JOUR

T1 - Improved variable-to-fixed length codes

AU - Klein, Shmuel T.

AU - Shapira, Dana

PY - 2008

Y1 - 2008

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%.

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%.

UR - http://www.scopus.com/inward/record.url?scp=85041117583&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-89097-3_6

DO - 10.1007/978-3-540-89097-3_6

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:85041117583

SN - 0302-9743

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 -

Improved variable-to-fixed length codes

Abstract

Access to Document

Other files and links

Fingerprint

Cite this