This article is
- freely available
Interactive Compression of Digital Data
Dipartimento di Informatica ed Applicazioni “R. M. Capocelli”, Università di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy
Received: 4 November 2009; in revised form: 8 January 2010 / Accepted: 25 January 2010 / Published: 29 January 2010
Abstract: 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.
Keywords: data compression; entropy; conditional compression
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Carpentieri, B. Interactive Compression of Digital Data. Algorithms 2010, 3, 63-75.
Carpentieri B. Interactive Compression of Digital Data. Algorithms. 2010; 3(1):63-75.
Carpentieri, Bruno. 2010. "Interactive Compression of Digital Data." Algorithms 3, no. 1: 63-75.