To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr19c1d
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Braverman, Mark | - |
dc.contributor.author | Mao, Jieming | - |
dc.date.accessioned | 2021-10-08T19:44:50Z | - |
dc.date.available | 2021-10-08T19:44:50Z | - |
dc.date.issued | 2015 | en_US |
dc.identifier.citation | Braverman, 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.2688087 | en_US |
dc.identifier.uri | https://arxiv.org/pdf/1409.4290.pdf | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr19c1d | - |
dc.description.abstract | We 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.extent | 21 - 30 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Simulating Noisy Channel Interaction | en_US |
dc.type | Conference Article | en_US |
dc.identifier.doi | 10.1145/2688073.2688087 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceeding | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
SimulatingNoisyChannelInteraction.pdf | 254.63 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.