Name
Abstract | ||
|---|---|---|
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 small number of symbols of the string. Locally testable codes (LTCs) are both interesting in their own right, and have important applications in complexity theory. A long line of research tries to determine the best tradeoff between rate and distance that LTCs can achieve. In this work, we construct LTCs that have high rate (arbitrarily close to 1), have constant relative distance, and can be tested using (log n) O(log logn) queries. This improves over the previous best construction of LTCs with high rate, by the same authors, which uses exp( √ log n · log log n) queries [KMRS15]. In fact, as in [KMRS15], our result is actually stronger: for binary codes, we obtain LTCs that match the Zyablov bound for any rate 0 u003c r u003c 1. For codes over large alphabet (of constant size), we obtain LTCs that approach the Singleton bound, for any rate 0 u003c r u003c 1. |
Year | Venue | Field |
|---|---|---|
2015 | Electronic Colloquium on Computational Complexity (ECCC) | Discrete mathematics,Online codes,Binary logarithm,Combinatorics,Binary code,Block code,Error detection and correction,Code word,Worst-case complexity,Singleton bound,Mathematics |
DocType | Volume | Citations |
Journal | 22 | 1 |
PageRank | References | Authors |
0.35 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Swastik Kopparty | 1 | 384 | 32.89 |
| Or Meir | 2 | 66 | 10.47 |
| Noga Ron-Zewi | 3 | 40 | 9.89 |
| Shubhangi Saraf | 4 | 263 | 24.55 |