Algorithms 2010, 3(1), 63-75; doi:10.3390/a3010063
Article

Interactive Compression of Digital Data

email
Received: 4 November 2009; in revised form: 8 January 2010 / Accepted: 25 January 2010 / Published: 29 January 2010
(This article belongs to the Special Issue Data Compression)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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
PDF Full-text Download PDF Full-Text [375 KB, uploaded 29 January 2010 13:23 CET]

Export to BibTeX |
EndNote


MDPI and ACS Style

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

AMA Style

Carpentieri B. Interactive Compression of Digital Data. Algorithms. 2010; 3(1):63-75.

Chicago/Turabian Style

Carpentieri, Bruno. 2010. "Interactive Compression of Digital Data." Algorithms 3, no. 1: 63-75.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert