{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:38:08Z","timestamp":1760243888658,"version":"build-2065373602"},"reference-count":11,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2010,1,29]],"date-time":"2010-01-29T00:00:00Z","timestamp":1264723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3390\/a3010063","type":"journal-article","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T02:21:17Z","timestamp":1265077277000},"page":"63-75","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Interactive Compression of Digital Data"],"prefix":"10.3390","volume":"3","author":[{"given":"Bruno","family":"Carpentieri","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica ed Applicazioni \u201cR. M. Capocelli\u201d, Universit\u00e0 di Salerno, Via Ponte Don Melillo, 84084 Fisciano (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2010,1,29]]},"reference":[{"key":"ref_1","unstructured":"Shannon, C.S., and Weaver, W. (1949). The Mathematical Theory of Communication, University of Illinois Press."},{"key":"ref_2","unstructured":"Storer, J.A. (1988). Data Compression: Methods and Theory, Computer Science Press."},{"key":"ref_3","first-page":"856","article-title":"Conditional data compression: the lossless case","volume":"2","author":"Carpentieri","year":"2003","journal-title":"WSEAS Trans. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1142\/S0129054194000098","article-title":"Video compression and the complexity of aligning vectors","volume":"5","author":"Carpentieri","year":"1994","journal-title":"Int. J. Found. Comput. Sci."},{"key":"ref_5","unstructured":"Factor, M., Sheinwald, D., and Yassour, B. (2001, January March). Software compression in the client\/server environment. Proceedings of the IEEE Data Compression Conference (DCC 2001), Snowbird, UT, USA."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0020-0255(01)00099-8","article-title":"Compression in the presence of shared data","volume":"135","author":"Factor","year":"2001","journal-title":"Inform. Sci."},{"key":"ref_7","unstructured":"El Gamal, A., and Orlitsky, A. (1984, January October). Interactive data compression. Proceedings of the 25th Annual Symposium on Foundations of Computer Science, Singer Island, FL, USA."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(01)00316-7","article-title":"Sending compressed messages to a learned receiver on a bidirectional line","volume":"83","author":"Carpentieri","year":"2002","journal-title":"Inf. Process. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1147\/rd.312.0249","article-title":"Efficient randomized pattern-matching algorithms","volume":"31","author":"Karp","year":"1987","journal-title":"IBM J. Res. Develop."},{"key":"ref_10","unstructured":"Cilibrasi, R. (2007). Statistical Inference through Data Compression, ILLC Publications. ILLC Dissertation Series DS-2007-01."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","article-title":"Clustering by compression","volume":"51","author":"Cilibrasi","year":"2005","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/3\/1\/63\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T22:01:22Z","timestamp":1760220082000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/3\/1\/63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,29]]},"references-count":11,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,3]]}},"alternative-id":["a3010063"],"URL":"https:\/\/doi.org\/10.3390\/a3010063","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2010,1,29]]}}}