Sending compressed messages to a learned receiver on a bidirectional line.

DOI10.1016/S0020-0190(01)00316-7zbMath1043.68060OpenAlexW2075229245MaRDI QIDQ1853045

Bruno Carpentieri

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00316-7

zbMATH Keywords

AlgorithmsData compressionCommunication

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12) Source coding (94A29)

Cites Work

• Efficient randomized pattern-matching algorithms
• Data compression with long repeated strings
• Compression in the presence of shared data

This page was built for publication: Sending compressed messages to a learned receiver on a bidirectional line.