Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,505,484 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Code word
Forward error correction
Hadamard code
Hamming distance
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Locally Testable Non-Malleable Codes ∗
Silas Richelson
,
Sourya Roy
2019
Corpus ID: 202579653
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
C C ] 23 A ug 2 01 3 Locally Testable Codes and Cayley Graphs
Parikshit Gopalan
,
S. Vadhan
,
Yuan Zhou
2018
Corpus ID: 125083654
We give two new characterizations of ( F2-linear) locally testable error-correcting codes in terms of Cayley graphs over F 2 : 1…
Expand
2015
2015
New error correcting codes from lifting
Alan J. X. Guo
2015
Corpus ID: 28914741
Error correcting codes have been widely used for protecting information from noise. The theory of error correcting codes studies…
Expand
2013
2013
Strong LTCs with Inverse Polylogarithmic Rate and Soundness
M. Viderman
IEEE Conference on Computational Complexity
2013
Corpus ID: 7944405
An error-correcting code C ⊆ Fn is called (q, ε)-strong locally testable code (LTC) if there exists a randomized algorithm…
Expand
2012
2012
Locally Testable Codes and Expanders Irit Dinur
T. Kaufman
2012
Corpus ID: 14617541
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
2012
2012
Bounds on locally testable codes with unique tests
Gillat Kol
,
R. Raz
Information Technology Convergence and Services
2012
Corpus ID: 2110361
The Unique Games Conjecture (UGC) is an important open problem in the research of PCPs and hardness of approximation. The…
Expand
2010
2010
Low Rate Is Insufficient for Local Testability
Eli Ben-Sasson
,
M. Viderman
International Workshop and International Workshop…
2010
Corpus ID: 9976558
Three results are shown regarding locally testable and locally decodable linear codes. All three results rely on the observation…
Expand
Review
2010
Review
2010
Local computation in codes
T. Kaufman
IEEE Information Theory Workshop
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…
Expand
2009
2009
Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist
Gillat Kol
,
R. Raz
Electron. Colloquium Comput. Complex.
2009
Corpus ID: 18210555
The Unique Games Conjecture (UGC ) is possibly the most important open problem in the research of PCPs and hardness of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE