Variable to fixed-length codes for Markov Sources
IEEE Transactions on Information Theory
Software—Practice & Experience
Fast and flexible word searching on compressed text
ACM Transactions on Information Systems (TOIS)
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms (TALG)
Using Fibonacci Compression Codes as Alternatives to Dense Codes
DCC '08 Proceedings of the Data Compression Conference
A Simple Algorithm for Computing the Lempel Ziv Factorization
DCC '08 Proceedings of the Data Compression Conference
An efficient compression code for text databases
ECIR'03 Proceedings of the 25th European conference on IR research
Generalized Tunstall codes for sources with memory
IEEE Transactions on Information Theory
Indexing Variable Length Substrings for Exact and Approximate Matching
SPIRE '09 Proceedings of the 16th International Symposium on String Processing and Information Retrieval
Training parse trees for efficient VF coding
SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
| Hi-index | 0.00 |
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%.