A Comparison of Text Compression Algorithms

Victor K. Wei
Additional contact information
Victor K. Wei: Bellcore

A chapter in Sequences, 1990, pp 358-365 from Springer

Abstract: Abstract We simulate and compare several text compression algorithms, including the Huffman coding, Lempel-Ziv algorithm, interval coding, and some locally adaptive schemes on selected text, source program, and data files. In most cases tested here, recency rank (also known as move-to-front rule) data compression scheme compares favorably against Lempel-Ziv and achieve about 60% compression.

Keywords: Data Compression; Source Program; List Size; Huffman Code; Integer Representation (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_28

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_28

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().