Lossy On-Line Dynamic Data Compression

James A. Storer
Additional contact information
James A. Storer: Brandeis University, Computer Science Department

A chapter in Sequences, 1990, pp 348-357 from Springer

Abstract: Abstract We use the term data to mean digital data: data that is represented as a sequence of characters drawn from the input alphabet ∑. Data compression is the process of encoding (“compressing”) a body of data into a smaller body of data. With lossless data compression, it must be possible for the compressed data to be decoded (“decompressed”) back to the original data, whereas with lossy data compression, compressed data need only be decoded back to some acceptable approximation to the original data (where “acceptable” is defined by some fidelity criteria that is provided to the algorithm).

Keywords: Data Compression; Encode Algorithm; Dictionary Entry; Input Stream; Greedy Heuristic (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_27

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

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

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 ().