Abstract
The performance of data compression on a large static text may be improved if certain variable-length strings are included in the character set for which a code is generated. A new method for extending the alphabet is presented, based on a reduction to a graph-theoretic problem. A related optimization problem is shown to be NP-complete, a fast heuristic is suggested, and experimental results are presented.
Original language | English |
---|---|
Title of host publication | Language, Culture, Computation. Computing-Theory and Technology |
Editors | Nachum Dershowitz, Ephraim Nissan |
Publisher | Springer Verlag |
Pages | 197-212 |
Number of pages | 16 |
Volume | 8001 |
ISBN (Electronic) | 978-3-642-45321-2 |
ISBN (Print) | 978-3-642-45320-5 |
DOIs | |
State | Published - 2014 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Publisher | Springer Verlag |
ISSN (Print) | 0302-9743 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2014.