Skip Navigation

The Computer Journal 1997 40(2 and 3):117-126; doi:10.1093/comjnl/40.2_and_3.117
© 1997 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Klein, S. T.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Optimal Recompression

S. T. Klein

Department of Mathematics and Computer Science, Bar-Ilan University, Ramat Gan 52900, Israel Email: tomi{at}cs.biu.ac.il

An efficient variant of an optimal algorithm is presented, which reorganizes data that has been compressed by some on-the-fly compression method, into a more compact form, without changing the decoding procedure. The algorithm accelerates and improves the space requirements of a known technique based on a reduction to a graph-theoretic problem, by reducing the size of the graph, without affecting the efficiency of the solution that is optimal for the given encoding method. The new method can effectively improve any static dictionary compression scheme using a static encoding method, and in particular some LZ77 variants.

Received June 18, 1996. revised April 18, 1997.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.