Jump to content

Locally decodable code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Ylloh (talk | contribs) at 14:48, 13 October 2010 (added link to locally testable codes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A locally decodable error-correcting code is one in which a single bit of a message can be decoded with high probability from only a small number of bits from a partially corrupted codeword.[1][2] Locally decodable codes can be seen as a special case of locally testable codes, where the requirement is merely to locally detect whether a given message is a codeword.

References

  1. ^ Rafail Ostrovsky, Omkant Pandey, Amit Sahai. "Private Locally Decodable Codes" (PDF).{{cite web}}: CS1 maint: multiple names: authors list (link)
  2. ^ Sergey Yekhanin. New locally decodable codes and private information retrieval schemes, Technical Report ECCC TR06-127, 2006.

See also