# Locally decodable code

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- IACR Cryptology ePrint Archive
- 2013

We introduce the notion of locally updatable and locally decodable codes (LULDCs). In addition to having low decode localityâ€¦Â (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- CSR
- 2011

An r-query Locally Decodable Code (LDC) C encodes k-symbol messages x to n-symbol codewords C(x). For every i âˆˆ [k] the decoderâ€¦Â (More)

Is this relevant?

2011

2011

- STOC
- 2011

A q-query Locally Decodable Code (LDC) is an error-correcting code that allows to read any particular symbol of the message byâ€¦Â (More)

Is this relevant?

2008

2008

- CRYPTO
- 2008

In this paper we introduce the notion of a Public-Key Encryption Scheme that is also a Locally-Decodable Error-Correcting Codeâ€¦Â (More)

Is this relevant?

2008

2008

- APPROX-RANDOM
- 2008

A (q, Î´, )-locally decodable code (LDC) C : {0, 1} â†’ {0, 1} is an encoding from n-bit strings to m-bit strings such that each bitâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- J. ACM
- 2007

A <i>q</i>-query Locally Decodable Code (LDC) encodes an <i>n</i>-bit message <i>x</i> as an <i>N</i>-bit codeword <i>C</i>(<i>xâ€¦Â (More)

Is this relevant?

2007

2007

- IACR Cryptology ePrint Archive
- 2007

We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversaryâ€¦Â (More)

Is this relevant?

2007

2007

- Electronic Colloquium on Computational Complexity
- 2007

Locally Decodable codes(LDC) support decoding of any parti cular symbol of the input message by reading constant number ofâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- STOC
- 2003

A locally decodable code encodes <i>n</i>-bit strings <i>x</i> in <i>m</i>-bit codewords <i>C(x)</i>, in such a way that one canâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- computational complexity
- 2002

We prove that if a linear error-correcting code C:{0, 1} n â†’{0, 1} m is such that a bit of the message can be probabilisticallyâ€¦Â (More)

Is this relevant?