Jonathan Katz
- 1.A. Ambainis. Upper bounds on the communication complexity of private information retrieval. In Proceedings of ICALP, pages 401-407, 1997. Google Scholar
Digital Library
- 2.S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Journal of the A CM, 45(3):501-555, 1998. Preliminary version in Proc. of FOCS'92. Google ScholarDigital Library
- 3.S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the A CM, 45(1):70-122, 1998. Preliminary version in Proc. of FOC$'92. Google ScholarDigital Library
- 4.L. Babai, L. Fortnow, L. Levin, and M. Szegedy. Checking computations in polylogarithmic time. In Proceedings of the 23rd A CM Symposium on Theory of Computing, pages 21-31, 1991. Google ScholarDigital Library
- 5.L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXP- TIME has publishable proofs. Computational Complexity, 3(4):307-318, 1993. Google ScholarDigital Library
- 6.D. Beaver and J. Feigenbaum. Hiding instances in multi-oracle queries. In 7th Annual Symposium on Theoretical Aspects of Computer Science, volume 415 of Lecture Notes in Computer Science, pages 37-48, Rouen, France, 22-24 February 1990. Springer. Google ScholarDigital Library
- 7.B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. Journal of the A CM, 45(6), 1998. Preliminary version in Proc. of FOCS'95. Google ScholarDigital Library
- 8.J. Feigenbaum and L. Fortnow. Random selfreducibility of complete sets. SIAM Journal on Computing, 22(5):994-1005, October 1993. Google ScholarDigital Library
- 9.P. Gemmell, R. Lipton, R. Rubinfeld, M. Sudan, and A. Wigderson. Self-testing/correcting for polynomials and for approximate functions. In Proceedings of the Twenty Th4rd Annual A CM Symposium on Theory of Computing, pages 32-42, New Orleans, Louisiana, 6-8 May 1991. Google ScholarDigital Library
- 10.P. Gemmell and M. Sudan. Highly resilient correctots for polynomials. Information Processing Letters, 43(4):169-174, 28 September 1992. Google ScholarDigital Library
- 11.O. Goldreich. Personal communication. September 1999.Google Scholar
- 12.L. Levin. Research overview. http://ww~, cs. bu. edu/f ac/lnd/res earch/res, html.Google Scholar
- 13.R. Lipton. New directions in testing. In Proceedings of DIMACS Workshop on Distributed Computing and Cryptography, 1989.Google Scholar
- 14.E. Mann. Private access to distributed information. Master's Thesis, Technion, 1998.Google Scholar
- 15.A. Polishchuk and D.A. Spielman. Nearly linear-size holographic proofs. In Proceedings of the ~6th A CM Symposium on Theory of Computing, pages 194-203, 1994. Google ScholarDigital Library
- 16.M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. In Proceedings of the 31st A CM Symposium on Theory of Computing, pages 537-546, 1999. Google ScholarDigital Library
Index Terms
- On the efficiency of local decoding procedures for error-correcting codes
Recommendations
Optimal Unidirectional Error Detecting/Correcting Codes
In this correspondence a class of t-error correcting and multiple unidirectional error detecting systematic codes is presented. These codes are significantly more efficient than the earlier codes. The efficiency of these codes approaches the efficiency ...
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams
Coding in the projective space has received recently a lot of attention due to its application in network coding. Reduced row echelon form of the linear subspaces and Ferrers diagram can playa key role for solving coding problems in the projective ...
Comments