A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Query Complexity Lower Bounds for Reconstruction of Codes

2014
*
Theory of Computing
*

We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008) , in the context of error correcting codes. The first problem we address is that of message reconstruction, where given oracle access to a corrupted encoding w ∈ {0, 1} n of some message x ∈ {0, 1} k our goal is to probabilistically recover x (or some portion of it). This should be done by a procedure (reconstructor) that given an index i as input, probes w at few locations and outputs the value of x i .

doi:10.4086/toc.2014.v010a019
dblp:journals/toc/ChakrabortyFM14
fatcat:pywkce2wbzcafhiraoogtyrzuy