Robust locally testable codes and products of codes

2006 ◽  
Vol 28 (4) ◽  
pp. 387-402 ◽  
Author(s):  
Eli Ben-Sasson ◽  
Madhu Sudan
Keyword(s):  
Locally Testable Codes

scholarly journals High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity

2017 ◽  
Vol 64 (2) ◽  
pp. 1-42 ◽  
Author(s):  
Swastik Kopparty ◽  
Or Meir ◽  
Noga Ron-Zewi ◽  
Shubhangi Saraf
Keyword(s):  
High Rate ◽  
Query Complexity ◽  
Locally Testable Codes

scholarly journals Locally Testable Codes Require Redundant Testers

2010 ◽  
Vol 39 (7) ◽  
pp. 3230-3247 ◽  
Author(s):  
Eli Ben-Sasson ◽  
Venkatesan Guruswami ◽  
Tali Kaufman ◽  
Madhu Sudan ◽  
Michael Viderman
Keyword(s):  
Locally Testable Codes

scholarly journals Strong Locally Testable Codes with Relaxed Local Decoders

2019 ◽  
Vol 11 (3) ◽  
pp. 1-38
Author(s):  
Oded Goldreich ◽  
Tom Gur ◽  
Ilan Komargodski
Keyword(s):  
Locally Testable Codes

Review of Introduction To Property Testing by Oded Goldreich

2021 ◽  
Vol 51 (4) ◽  
pp. 6-10
Author(s):  
Sarvagya Upadhyay
Keyword(s):  
Decision Making ◽  
Lower Bound ◽  
Computer Science ◽  
Property Testing ◽  
Probabilistically Checkable Proofs ◽  
Graph Properties ◽  
Locally Testable Codes ◽  
Entire Object ◽  
Functions And Graphs ◽  
Distribution Testing

The area of property testing is concerned with designing methods to decide whether an input object possesses a certain property or not. Usually the problem is described as a promise problem: either the input object has the property or the input object is far from possessing the property. Here, the meaning of object being far from possessing the property is based on a specified and meaningful notion of distance. The main objective of property testing is accomplishing this decision making by developing a super efficient tester. A tester that reads through the entire object can easily determine whether the property is satisfied or not. However, one wishes the tester to probe the input at very few random locations and determine whether the property is satisfied. As such, randomness is a necessary ingredient for testing and having the tester erring on few instances is a necessary price to pay for designing highly efficient methodologies. Much of the literature on property testing has focused on two types of objects: functions and graphs. Naturally they form the major portion of the book: functions are discussed from Chapters 2 to 6 and graph properties are discussed from Chapters 8 to 10. The final three chapters focus on distribution testing, probabilistically checkable proofs (PCPs) and locally testable codes, and ramifications of property testing on other related topics in Computer Science and Statistics. A separate chapter is devoted to query lower bound techniques.

scholarly journals Bounds on 2-query Locally Testable Codes with affine tests

2016 ◽  
Vol 116 (8) ◽  
pp. 521-525
Author(s):  
Gillat Kol ◽  
Ran Raz
Keyword(s):  
Locally Testable Codes

Locally testable codes and PCPs of almost-linear length

2006 ◽  
Vol 53 (4) ◽  
pp. 558-655 ◽  
Author(s):  
Oded Goldreich ◽  
Madhu Sudan
Keyword(s):  
Locally Testable Codes
Sign in / Sign up

Export Citation Format

Share Document