Locally testable and locally correctable codes approaching the gilbert-varshamov bound

Keyphrases

• Locally Testable 100%
• Local Testing 100%
• Gilbert-Varshamov Bound 100%
• Locally Correctable Codes 100%
• Minimum Distance 75%
• Local Correction 75%
• Query Complexity 50%
• List Decoding 50%
• Correction Algorithm 50%
• Local Testability 50%
• Error Theory 25%
• Error Detection 25%
• Error Correction Codes 25%
• Simple Function 25%
• Testing Algorithm 25%
• Binary Codes 25%
• Locally Decodable Codes 25%
• Local Error 25%
• Recoverability 25%
• Error Correction Mechanism 25%
• Reed-Muller Codes 25%
• Locally Testable Codes 25%
• Minimum Rate 25%
• Randomized Constructions 25%
• Concatenation Methods 25%
• Guruswami-Sudan 25%
• Decoding Strategies 25%
• Concatenated Codes 25%
• List-decodability 25%

Mathematics

• Gilbert-Varshamov Bound 100%
• Correction Algorithm 100%
• Query Complexity 66%
• Polynomial Time 33%
• Open Problem 33%
• Error Correction 33%
• Error Detection 33%
• Simple Function 33%
• Local Time 33%
• Reed-Muller Code 33%
• Binary Code 33%
• Theory of Error-Correcting Codes 33%
• Concatenated Code 33%

Computer Science

• Correction Algorithm 100%
• Local Correction 100%
• Polynomial Time 33%
• Error Detection 33%
• Error Correction 33%
• Error-correcting code 33%
• Concatenated Code 33%