On matrix rigidity and locally self-correctable codes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2010, Pages 291-298

  Dvir, Zeev ^a  

^a IAS   (United States)

Author keywords

Arithmetic circuits; Complexity; Matrices

Indexed keywords

ARITHMETIC CIRCUIT; LINEAR FUNCTIONS; LOCALLY-DECODABLE CODES; LOWER BOUNDS; MATRIX; MATRIX RIGIDITY; NATURAL PROPERTIES; NEW APPROACHES; REED-MULLER CODES; SUPERLINEAR;

COMPUTATIONAL COMPLEXITY; DECODING; INTEGRATING CIRCUITS; LOGIC CIRCUITS;

MATRIX ALGEBRA;

EID: 77955233118     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2010.35     Document Type: Conference Paper

References (22)

1. Noga Alon, Rina Panigrahy, and Sergey Yekhanin. Deterministic approximation algorithms for the nearest codeword problem. In APPROX '09 / RANDOM '09: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 339-351, Berlin, Heidelberg, 2009. Springer-Verlag.
2. Amos Beimel, Yuval Ishai, Eyal Kushilevitz, and Jean-François Raymond. Breaking the o(n1/(2k-1)) barrier for information-theoretic private information retrieval. In FOCS, pages 261-270. IEEE Computer Society, 2002.
3. Omer Barkol, Yuval Ishai, and Enav Weinreb. On locally decodable codes, self-correctable codes, and t-private pir. In APPROX '07/RANDOM '07: Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 311-325, Berlin, Heidelberg, 2007. Springer-Verlag.
4. Manuel Blum and Sampath Kannan. Designing programs that check their work. J. ACM, 42(1):269-291, 1995.
5. László Babai, Amir Shpilka, and Daniel Stefankovic. Locally testable cyclic codes. IEEE Transactions on Information Theory, 51(8):2849-2858, 2005.
6. Zeev Dvir, Parikshit Gopalan, and Sergey Yekhanin. Matching vector codes. Manuscript, 2010.
7. Klim Efremenko. 3-query locally decodable codes of subexponential length. In Michael Mitzenmacher, editor, STOC, pages 39-44. ACM, 2009.
8. Oded Goldreich, Howard J. Karloff, Leonard J. Schulman, and Luca Trevisan. Lower bounds for linear locally decodable codes and private information retrieval. Computational Complexity, 15(3):263-296, 2006. (Pubitemid 44757259)
9. Parikshit Gopalan. A note on efremenko's locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC), (069), 2009.
10. W. C. Huffman and Richard A. Brualdi. Handbook of Coding Theory. Elsevier Science Inc., New York, NY, USA, 1998.
11. Iordanis Kerenidis and Ronald de Wolf. Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci., 69(3):395-420, 2004.
12. Jonathan Katz and Luca Trevisan. On the efficiency of local decoding procedures for error-correcting codes. In STOC, pages 80-86, 2000.
13. Richard J. Lipton. Efficient checking of computations. In Christian Choffrut and Thomas Lengauer, editors, STACS, volume 415 of Lecture Notes in Computer Science, pages 207-215. Springer, 1990.
14. Satyanarayana V. Lokam. Quadratic lower bounds on matrix rigidity. In Jin yi Cai, S. Barry Cooper, and Angsheng Li, editors, TAMC, volume 3959 of Lecture Notes in Computer Science, pages 295-307. Springer, 2006.
15. Satyanarayana V. Lokam. Complexity lower bounds using linear algebra. Foundations and Trends in Theoretical Computer Science, 4(1-2):1-155, 2009.
16. F.J. MacWilliams and N.J.A. Sloane. The theory of error correcting codes. 1977.
17. Alexander A. Razborov and Steven Rudich. Natural proofs. J. Comput. Syst. Sci., 55(1):24-35, 1997.
18. Luca Trevisan. Some applications of coding theory in computational complexity. Quaderni di Matematica, 13:2004, 2004.
19. Leslie G. Valiant. Graph-theoretic arguments in low-level complexity. In Jozef Gruska, editor, MFCS, volume 53 of Lecture Notes in Computer Science, pages 162-176. Springer, 1977.
20. Leslie G. Valiant. Completeness classes in algebra. In STOC '79: Proceedings of the eleventh annual ACM symposium on Theory of computing, pages 249-261, New York, NY, USA, 1979. ACM.
21. David Woodruff. New lower bounds for general locally decodable codes. Electronic Colloquium on Computational Complexity (ECCC) TR07-006, 2007.
22. Sergey Yekhanin. Towards 3-query locally decodable codes of subexponential length. J. ACM, 55(1), 2008.