Author of the publication

Locally Testable vs. Locally Decodable Codes.

, and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 670-682. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Composition of semi-LTCs by two-wise Tensor Products., and . Electron. Colloquium Comput. Complex., (2011)Testing Membership in Counter Automaton Languages., and . APPROX-RANDOM, volume 8096 of Lecture Notes in Computer Science, page 543-558. Springer, (2013)Composition of Semi-LTCs by Two-Wise Tensor Products., and . APPROX-RANDOM, volume 5687 of Lecture Notes in Computer Science, page 378-391. Springer, (2009)Strong LTCs with Inverse Poly-Log Rate and Constant Soundness.. FOCS, page 330-339. IEEE Computer Society, (2013)Tensor Products of Weakly Smooth Codes Are Robust., and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 290-302. Springer, (2008)A Combination of Testability and Decodability by Tensor Products.. APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 651-662. Springer, (2012)Low Rate Is Insufficient for Local Testability., and . APPROX-RANDOM, volume 6302 of Lecture Notes in Computer Science, page 420-433. Springer, (2010)Linear time decoding of regular expander codes.. ITCS, page 168-182. ACM, (2012)Interpreting Complex Regression Models., , , and . CoRR, (2018)Towards lower bounds on locally testable codes.. Technion - Israel Institute of Technology, Israel, (2012)