28 search results - page 5 / 6 » Query-Efficient Locally Decodable Codes of Subexponential Le... |
ICC
2007
IEEE
14 years 2 days 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
13 years 11 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 4 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 16 days 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...
STACS
2010
Springer
14 years 22 days 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...