Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Locally testable code

A locally testable code is a type of error-correcting code for which it can be determined if a string is a word in that code by looking at a small… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
In this work we adapt the notion of non-malleability for codes of Dziembowski, Pietrzak and Wichs (ICS 2010) to locally testable… Expand
2018
2018
We give two new characterizations of ( F2-linear) locally testable error-correcting codes in terms of Cayley graphs over F 2 : 1… Expand
2017
2017
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the… Expand
2017
2017
Affine-invariant codes are codes whose coordinates form a vector space over a finite field and which are invariant under affine… Expand
2013
2013
We give two new characterizations of ( 2-linear, smooth) locally testable error-correcting codes in terms of Cayley graphs over… Expand
2012
2012
The Unique Games Conjecture (UGC) is an important open problem in the research of PCPs and hardness of approximation. The… Expand
  • figure 3
2012
2012
A locally testable code is a code defined by a robust set of local constraints. Namely, the distance of a vector from the code is… Expand
2011
2011
A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most… Expand
2010
2010
Three results are shown regarding locally testable and locally decodable linear codes. All three results rely on the observation… Expand
2009
2009
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of… Expand
  • figure 1
  • figure 3