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

نتاج البحث: نشر في مجلة › مقالة من مؤنمر › مراجعة النظراء

11 اقتباسات (Scopus)

ملخص

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

اللغة الأصلية	الإنجليزيّة
الصفحات (من إلى)	39-50
عدد الصفحات	12
دورية	Lecture Notes in Computer Science
مستوى الصوت	5280 LNCS
المعرِّفات الرقمية للأشياء	https://doi.org/10.1007/978-3-540-89097-3_6
حالة النشر	نُشِر - 2008
منشور خارجيًا	نعم
الحدث	15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 - Melbourne. VIC, أستراليا المدة: ١٠ نوفمبر ٢٠٠٨ → ١٢ نوفمبر ٢٠٠٨

الوصول إلى المستند

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

الملفات والروابط الأخرى

Link to publication in Scopus

قم بذكر هذا

@article{2e950b944ae245979d466680ca5ff650,

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

issn = "0302-9743",

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

JF - Lecture Notes in Computer Science

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

ملخص

الوصول إلى المستند

الملفات والروابط الأخرى

بصمة

قم بذكر هذا