Sending compressed messages to a learned receiver on a bidirectional line

Authors:
Bruno Carpentieri
Affiliations:
Dipartimento di Informatica ed Applicazioni, Università di Salerno, Baronissi (SA), Italy
Venue:
Information Processing Letters
Year:
2002

Citing 6
Cited 2

Data compression: methods and theory

Data compression: methods and theory
Data compression with long repeated strings

Information Sciences: an International Journal - Dictionary based compression
Compression in the presence of shared data

Information Sciences: an International Journal - Dictionary based compression
Data Compression Using Long Common Strings

DCC '99 Proceedings of the Conference on Data Compression
Software Compression in the Client/Server Environment

DCC '01 Proceedings of the Data Compression Conference
Efficient randomized pattern-matching algorithms

IBM Journal of Research and Development - Mathematics and computing

Interactive compression of books

WSEAS Transactions on Computers
Improving dictionary based data compression by using previous knowledge and interaction

AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper we present communication protocols that allow a "learned" sender and a "learned" receiver to communicate on a bidirectional line, compressing files with (static or dynamic) dictionaries initially built independently by the sender and the receiver from the examples of the source output they have available. We show that this leads to an improvement in compression paid with a negligible or almost null possibility of communication errors.