Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

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… 
2017
2017
We present an algorithm that takes a CSS stabilizer code as input, and outputs another CSS stabilizer code such that the… 
2013
2013
We give two new characterizations of ( 2-linear, smooth) locally testable error-correcting codes in terms of Cayley graphs over… 
2013
2013
  • Michael Viderman
  • IEEE 54th Annual Symposium on Foundations of…
  • 2013
  • Corpus ID: 6860324
An error-correcting code C is called (q, ϵ)-strong locally testable code (LTC) if there exists a tester that makes at most q… 
2013
2013
In this paper, we obtain a composition theorem that allows us to construct locally testable codes (LTCs) by repeated two-wise… 
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… 
2012
2012
The Unique Games Conjecture (UGC) is an important open problem in the research of PCPs and hardness of approximation. The… 
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… 
2010
2010
Three results are shown regarding locally testable and locally decodable linear codes. All three results rely on the observation… 
2009
2009
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of…