Proceedings of the 35th Annual ACM Symposium on the Theory of Computing

4.11 - 1251 ratings - Source

In particular, we would like to use our techniques to get better lower bounds for
locally decodable codes ... Let P, j = \i)(i\ + \j)(j\ be the projector on the states \i)
and \j). Suppose (ii, ji) ... Technical Note 2002-L001N, NEC Laboratories America
, 2002. ... On the efficiency of local decoding procedures for error-correcting
codes.

Title

:

Proceedings of the 35th Annual ACM Symposium on the Theory of Computing

Author

:

ACM Special Interest Group for Algorithms and Computation Theory

Publisher

:

Assn for Computing Machinery - 2003

ISBN-13

:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.