Dynamic Asymmetric Communication
classification
💻 cs.IT
math.IT
keywords
communicationasymmetricbandwidthdynamicmessagesserveralgorithmassume
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.