Next Article in Journal
InfoVis Interaction Techniques in Animation of Recursive Programs
Next Article in Special Issue
Suffix-Sorting via Shannon-Fano-Elias Codes
Previous Article in Journal
Breast Cancer Detection with Gabor Features from Digital Mammograms
Previous Article in Special Issue
Linear-Time Text Compression by Longest-First Substitution
Open AccessArticle

Interactive Compression of Digital Data

Dipartimento di Informatica ed Applicazioni “R. M. Capocelli”, Università di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy
Algorithms 2010, 3(1), 63-75;
Received: 4 November 2009 / Revised: 8 January 2010 / Accepted: 25 January 2010 / Published: 29 January 2010
(This article belongs to the Special Issue Data Compression)
PDF [375 KB, uploaded 29 January 2010]


If we can use previous knowledge of the source (or the knowledge of a source that is correlated to the one we want to compress) to exploit the compression process then we can have significant gains in compression. By doing this in the fundamental source coding theorem we can substitute entropy with conditional entropy and we have a new theoretical limit that allows for better compression. To do this, when data compression is used for data transmission, we can assume some degree of interaction between the compressor and the decompressor that can allow a more efficient usage of the previous knowledge they both have of the source. In this paper we review previous work that applies interactive approaches to data compression and discuss this possibility. View Full-Text
Keywords: data compression; entropy; conditional compression data compression; entropy; conditional compression

Figure 1

This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Share & Cite This Article

MDPI and ACS Style

Carpentieri, B. Interactive Compression of Digital Data. Algorithms 2010, 3, 63-75.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top