תקציר
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 |
| מזהי עצם דיגיטלי (DOIs) | |
| סטטוס פרסום | פורסם - 2008 |
| פורסם באופן חיצוני | כן |
| אירוע | 15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 - Melbourne. VIC, אוסטרליה משך הזמן: 10 נוב׳ 2008 → 12 נוב׳ 2008 |