Dynamic Asymmetric Communication

DOI10.1007/11780823_24MaRDI QIDQ3613660zbMATH OpenOpenAlexFDO

Authors Travis Gagie

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0506025

Mathematics Subject Classification ID

Network protocols (68M12)

Abstract: We show how any dynamic instantaneous compression algorithm can be converted to an asymmetric communication protocol, with which a server with high bandwidth can help clients with low bandwidth send it messages. Unlike previous authors, we do not assume the server knows the messages' distribution, and our protocols are the first to use only one round of communication for each message.

Recommendations

• Dynamic asymmetric communication
• On asymmetric communication protocols
• Protocols for asymmetric communication channels
• scientific article; zbMATH DE number 1263186
• Improved bounds for asymmetric communication protocols.

Cited in

(8)

• Compressing probability distributions
• Protocols for asymmetric communication channels
• Asymmetric communication protocols via hotlink assignments
• Improved bounds for asymmetric communication protocols.
• Dynamic communication mechanism design
• On asymmetric communication protocols
• Dynamic Shannon coding
• Dynamic asymmetric communication

This page was built for publication: Dynamic Asymmetric Communication

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