To refer to this page use:
http://arks.princeton.edu/ark:/88435/pr16j85
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Braverman, Mark | - |
dc.date.accessioned | 2021-10-08T19:44:46Z | - |
dc.date.available | 2021-10-08T19:44:46Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | Braverman, Mark. "Towards deterministic tree code constructions." In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (2012): pp. 161-167. doi:10.1145/2090236.2090250 | en_US |
dc.identifier.uri | https://eccc.weizmann.ac.il//report/2011/064/ | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr16j85 | - |
dc.description.abstract | We present a deterministic operator on tree codes -- we call tree code product -- that allows one to deterministically combine two tree codes into a larger tree code. Moreover, if the original tree codes are efficiently encodable and decodable, then so is their product. This allows us to give the first deterministic subexponential-time construction of explicit tree codes: we are able to construct a tree code T of size n in time 2nε,. Moreover, T is also encodable and decodable in time 2nε,. We then apply our new construction to obtain a deterministic constant-rate error-correcting scheme for interactive computation over a noisy channel with random errors. If the length of the interactive computation is n, the amount of computation required is deterministically bounded by n1+o(1), and the probability of failure is n-ω(1). | en_US |
dc.format.extent | 161 - 167 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Proceedings of the 3rd Innovations in Theoretical Computer Science Conference | en_US |
dc.rights | Author's manuscript | en_US |
dc.title | Towards deterministic tree code constructions | en_US |
dc.type | Conference Article | en_US |
dc.identifier.doi | 10.1145/2090236.2090250 | - |
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 | |
---|---|---|---|---|
TowardsDeterministicTreeCodeConstruction.pdf | 560.19 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.