A New Approach to Alphabet Extension for Improving Static Compression Schemes

S. Klein

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

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 languageEnglish
Title of host publicationLanguage, Culture, Computation. Computing-Theory and Technology
EditorsNachum Dershowitz, Ephraim Nissan
PublisherSpringer Berlin Heidelberg
Pages197-212
Number of pages16
ISBN (Electronic)978-3-642-45321-2
ISBN (Print)978-3-642-45320-5
DOIs
StatePublished - 2014

Publication series

NameLecture Notes in Computer Science
Volume8001

Fingerprint

Dive into the research topics of 'A New Approach to Alphabet Extension for Improving Static Compression Schemes'. Together they form a unique fingerprint.

Cite this