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

DOI10.1016/S0020-0190(01)00316-7zbMATH Open1043.68060OpenAlexW2075229245MaRDI QIDQ1853045FDOQ1853045

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

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

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)

Cites Work

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

Cited In (3)

• Error-Resilient Optimal Data Compression
• Title not available (Why is that?)
• Semantic communication for simple goals is equivalent to on-line learning

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)