15 search results - page 3 / 3 » Corruption and Recovery-Efficient Locally Decodable Codes |
103
Voted
STOC
2007
ACM
16 years 25 days ago
2007
ACM
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
121
click to vote
ECCC
2006
15 years 16 days ago
2006
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
130
click to vote
COCO
2011
Springer
14 years 10 days ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
STACS
2009
Springer
15 years 7 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
137
click to vote
STACS
2010
Springer
15 years 7 months ago
2010
Springer
We construct efficient data structures that are resilient against a constant fraction of adversarial noise. Our model requires that the decoder answers most queries correctly with...