Computer Science – Information Theory
Scientific paper
2005-06-08
Computer Science
Information Theory
Previous versions appeared at DCC 06 and SIROCCO 06; current version is preliminary journal version
Scientific paper
10.1109/DCC.2006.29
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.
No associations
LandOfFree
Dynamic Asymmetric Communication does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Dynamic Asymmetric Communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic Asymmetric Communication will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-170358