Strong Locally Testable Codes with Relaxed Local Decoders

DOI10.1145/3319907zbMath1495.94159OpenAlexW2943465565WikidataQ127960593 ScholiaQ127960593MaRDI QIDQ5205813

Ilan Komargodski, Tom Gur, Oded Goldreich

Publication date: 16 December 2019

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5050/

zbMATH Keywords

error-correcting codeslocal testabilitylocal decodability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other types of codes (94B60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Unnamed Item ⋮ Smooth and strong PCPs

This page was built for publication: Strong Locally Testable Codes with Relaxed Local Decoders