Skip to main content

Simulating Noisy Channel Interaction

Author(s): Braverman, Mark; Mao, Jieming

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr19c1d
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBraverman, Mark-
dc.contributor.authorMao, Jieming-
dc.date.accessioned2021-10-08T19:44:50Z-
dc.date.available2021-10-08T19:44:50Z-
dc.date.issued2015en_US
dc.identifier.citationBraverman, Mark, and Jieming Mao. "Simulating noisy channel interaction." In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (2015): pp. 21-30. doi:10.1145/2688073.2688087en_US
dc.identifier.urihttps://arxiv.org/pdf/1409.4290.pdf-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr19c1d-
dc.description.abstractWe show that T rounds of interaction over the binary symmetric channel BSC1/2--ε with feedback can be simulated with O(ε2T) rounds of interaction over a noiseless channel. We also introduce a more general "energy cost" model of interaction over a noisy channel. We show energy cost to be equivalent to external information complexity, which implies that our simulation results are unlikely to carry over to energy complexity. Our main technical innovation is a self-reduction from simulating a noisy channel to simulating a slightly-less-noisy channel, which may have other applications in the area of interactive compression.en_US
dc.format.extent21 - 30en_US
dc.language.isoen_USen_US
dc.relation.ispartofProceedings of the 2015 Conference on Innovations in Theoretical Computer Scienceen_US
dc.rightsAuthor's manuscripten_US
dc.titleSimulating Noisy Channel Interactionen_US
dc.typeConference Articleen_US
dc.identifier.doi10.1145/2688073.2688087-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
SimulatingNoisyChannelInteraction.pdf254.63 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.