Longest Fragment First Algorithms for Data Compression
On—line text—compression algorithms are considered, where compression is done by substituting substrings of the text according to some fixed dictionary (code book). Due to the long running time of optimal compression algorithms, several on—line heuristics have been introduced in the literature. In this paper we analyse two modified version of an old algorithm introduced by Shuegraf and Heaps . We will investigate the worst case behaviour of this Longest Fragment First (LFF) algorithm for several types of special dictionaries.
KeywordsData Compression Greedy Heuristic Arithmetic Code Longe Fragment Source Word
Unable to display preview. Download preview PDF.
- 2.J. Békési, G. Galambos, U. Pferschy, G. J. Woeginger, Operations Research Proceedings, Ed. U. Derigs, A. Bachem, A. Drexl, Berlin, 1994, 76–80.Google Scholar
- 3.R. M. Fano, Transmission of information, Wiley, New York, 1961.Google Scholar
- 5.D. A Huffman, A method for the construction od minimum-redundancy codes, Proc Institute of Electrical and Radio Engineers, 40 (9), 1952, 1098–1101.Google Scholar