Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Revision(s):

Revision #1 to TR10-123 | 11th August 2010 19:41

Limitation on the rate of families of locally testable codes

RSS-Feed




Revision #1
Authors: Eli Ben-Sasson
Accepted on: 11th August 2010 19:41
Downloads: 1179
Keywords: 


Abstract:

This paper describes recent results which revolve around the question of the rate attainable by families of error correcting codes that are locally testable. Emphasis is placed on motivating the problem of proving upper bounds on the rate of these codes and a number of interesting open questions for future research are suggested.



Changes to previous version:

Typos and citation errors corrected


Paper:

TR10-123 | 4th August 2010 23:28

Limitation on the rate of families of locally testable codes





TR10-123
Authors: Eli Ben-Sasson
Publication: 4th August 2010 23:28
Downloads: 1589
Keywords: 


Abstract:

This paper describes recent results which revolve around the question of the rate attainable by families of error correcting codes that are locally testable. Emphasis is placed on motivating the problem of proving upper bounds on the rate of these codes and a number of interesting open questions for future research are suggested.



ISSN 1433-8092 | Imprint