29 search results - page 5 / 6 » 3-query locally decodable codes of subexponential length |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
— A matrix is described that transforms input vectors (blocks) of length (K − 2), consisting of digital PAM vector components, into output vectors (blocks) of length K. The mat...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We study the problem of rate-distortion optimal packetization with uneven erasure protection (UEP) of scalable source sequence, into multiple groups of packets. The grouping of pa...
ECCC
2010
13 years 6 months ago
2010
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 me...
STACS
2009
Springer
14 years 2 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...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...