Next: On the Implementation of
Up: Back at Weizmann (1998-2003)
Previous: The GGM Construction does
We present upper bounds on the size of codes that are locally
testable by querying only two input symbols. These upper bounds
are applicable to linear codes
as well as to general binary codes having one-sided error testers.
Comments:
Authored by E. Ben-Sasson, O. Goldreich and M. Sudan. Appeared in
ECCC, TR03-019, 2003.
- Proceedings of RANDOM, 2003, to appear.
Oded Goldreich
2003-07-30