Variable to fixed-length codes for Markov Sources
IEEE Transactions on Information Theory
Software—Practice & Experience
The data compression book (2nd ed.)
The data compression book (2nd ed.)
Data compression via textual substitution
Journal of the ACM (JACM)
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
Pattern matching in Huffman encoded texts
Information Processing and Management: an International Journal
The greedy algorithm for the minimum common string partition problem
ACM Transactions on Algorithms (TALG)
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
A New Searchable Variable-to-Variable Compressor
DCC '10 Proceedings of the 2010 Data Compression Conference
On the Usefulness of Fibonacci Compression Codes
The Computer Journal
The String-to-Dictionary Matching Problem
DCC '11 Proceedings of the 2011 Data Compression Conference
Generalized Tunstall codes for sources with memory
IEEE Transactions on Information Theory
A universal algorithm for sequential data compression
IEEE Transactions on Information Theory
Compression of individual sequences via variable-rate coding
IEEE Transactions on Information Theory
Practical fixed length Lempel-Ziv coding
Discrete Applied Mathematics
| 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 have useful applications, such as easier processing and fast decoding. This paper explores the construction of variable-to-fixed length codes, which have been suggested long ago by Tunstall. Using new heuristics based on suffix trees, the performance of Tunstall codes can in some cases be improved by more than 40%.