Improving Static Compression Schemes by Alphabet Extension

  • Authors:
  • Shmuel T. Klein

  • Affiliations:
  • -

  • Venue:
  • COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

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.