Proceedings of the 35th Annual ACM Symposium on the Theory of Computing
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 |
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.
How it works:- 1. Register a free 1 month Trial Account.
- 2. Download as many books as you like (Personal use)
- 3. Cancel the membership at any time if not satisfied.
