Some Applications of Coding Theory in Computational Complexity

Details Some Applications of Coding Theory in Computational Complexity Some Applications of Coding Theory in Computational Complexity

2004-09-24

arxiv.org/abs/cs/0409044v1

Computer Science

Computational Complexity

Scientific paper

Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable error-correcting codes, and their applications to complexity theory and to cryptography. Locally decodable codes are error-correcting codes with sub-linear time error-correcting algorithms. They are related to private information retrieval (a type of cryptographic protocol), and they are used in average-case complexity and to construct ``hard-core predicates'' for one-way permutations. Locally testable codes are error-correcting codes with sub-linear time error-detection algorithms, and they are the combinatorial core of probabilistically checkable proofs.

Affiliated with

Also associated with

No associations

Rating

Some Applications of Coding Theory in Computational Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Applications of Coding Theory in Computational Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Applications of Coding Theory in Computational Complexity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695010