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… 
2018
2018
We give two new characterizations of ( F2-linear) locally testable error-correcting codes in terms of Cayley graphs over F 2 : 1… 
2015
2015
Error correcting codes have been widely used for protecting information from noise. The theory of error correcting codes studies… 
2013
2013
  • M. Viderman
  • 2013
  • Corpus ID: 7944405
An error-correcting code C ⊆ Fn is called (q, ε)-strong locally testable code (LTC) if there exists a randomized algorithm… 
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… 
2010
2010
Three results are shown regarding locally testable and locally decodable linear codes. All three results rely on the observation… 
Review
2010
Review
2010
  • T. Kaufman
  • 2010
  • Corpus ID: 6608919
A locally testable code allows one to store vast amounts of data, where estimating the fraction of errors in the data takes… 
2009
2009
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of…