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

DOI10.1016/S0020-0190(01)00316-7MaRDI QIDQ1853045zbMATHOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 826049
• scientific article; zbMATH DE number 6866309
• Error-Resilient Optimal Data Compression
• scientific article; zbMATH DE number 3463523
• Deterministic compression with uncertain priors

Cites work

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

Cited in

(3)

• Semantic communication for simple goals is equivalent to on-line learning
• scientific article; zbMATH DE number 826049 (Why is no real title available?)
• Error-Resilient Optimal Data Compression

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853045)