Research output per year
Research output per year
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constant number of symbols of the string. Locally Testable Codes (LTCs) were first systematically studied by Goldreich and Sudan (J. ACM 53(4)) and since then several constructions of LTCs have been suggested. While the best known construction of LTCs by Ben-Sasson and Sudan (STOC 2005) and Dinur (J. ACM 54(3)) achieves very efficient parameters, it relies heavily on algebraic tools and on PCP machinery. In this work we present a new and arguably simpler construction of LTCs that is purely combinatorial, does not rely on PCP machinery and matches the parameters of the best known construction. However, unlike the latter construction, our construction is not entirely explicit.
Original language | English |
---|---|
Title of host publication | STOC'08 |
Subtitle of host publication | Proceedings of the 2008 ACM Symposium on Theory of Computing |
Publisher | Association for Computing Machinery (ACM) |
Pages | 285-294 |
Number of pages | 10 |
ISBN (Print) | 9781605580470 |
DOIs | |
State | Published - 2008 |
Externally published | Yes |
Event | 40th Annual ACM Symposium on Theory of Computing, STOC 2008 - Victoria, BC, Canada Duration: 17 May 2008 → 20 May 2008 |
Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|
ISSN (Print) | 0737-8017 |
Conference | 40th Annual ACM Symposium on Theory of Computing, STOC 2008 |
---|---|
Country/Territory | Canada |
City | Victoria, BC |
Period | 17/05/08 → 20/05/08 |
Research output: Contribution to journal › Article › peer-review