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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2004-2018
02420042018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or… (More)
Is this relevant?
2014
2014
Locally testable codes (LTCs) are error-correcting codes that admit very efficient codeword tests. An LTC is said to be strong if… (More)
  • figure 1
Is this relevant?
2013
2013
We give two new characterizations of ( <sub>2</sub>-linear, smooth) locally testable error-correcting codes in terms of Cayley… (More)
Is this relevant?
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… (More)
Is this relevant?
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… (More)
Is this relevant?
2010
2010
We study the relation between locally testable and locally decodable codes. Locally testable codes (LTCs) are error-correcting… (More)
Is this relevant?
2010
2010
The main open problem in the area of locally testable codes (LTCs) is whether there exists an asymptotically good family of LTCs… (More)
Is this relevant?
2009
2009
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by… (More)
Is this relevant?
2009
2009
We study Locally Testable Codes (LTCs) that can be tested by making two queries to the tested word using an a ne test. That is… (More)
Is this relevant?
2007
2007
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or… (More)
  • table 1
  • table 2
Is this relevant?