Dynamic Asymmetric Communication

Simple item page
dc.creatorGagie, Travis
dc.date2005-06-08
dc.date2006-11-21
dc.date.accessioned2026-07-07T08:17:48Z
dc.date.available2026-07-07T08:17:48Z
dc.descriptionWe 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.
dc.descriptionPrevious versions appeared at DCC 06 and SIROCCO 06; current version is preliminary journal version
dc.identifierhttps://arxiv.org/abs/cs/0506025
dc.identifierhttp://arxiv.org/abs/cs/0506025
dc.identifierdoi:10.1109/DCC.2006.29
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134216
dc.subjectInformation Theory
dc.subjectE.4
dc.titleDynamic Asymmetric Communication
dc.typetext

Files

Collections

arXiv