Interactive Compression of Digital Data
AbstractIf 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
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
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.Chicago/Turabian Style
Carpentieri, Bruno. 2010. "Interactive Compression of Digital Data." Algorithms 3, no. 1: 63-75.