Name
Abstract | ||
|---|---|---|
We study the relation between locally testable and locally decodable codes. Locally testable codes (LTCs) are error-correcting codes for which membership of a given word in the code can be tested probabilistically by examining it in very few locations. Locally decodable codes (LDCs) allow to recover each message entry with high probability by reading only a few entries of a slightly corrupted codeword. A linear code C ⊆ F2n is called sparse if n ≥ 2Ω(dim(C)). It is well-known that LTCs do not imply LDCs and that there is an intersection between these two families. E.g. the Hadamard code is both LDC and LTC. However, it was not known whether LDC implies LTC. We show the following results. - Two-transitive codes with a local constraint imply LDCs, while they do not imply LTCs. - Every non-sparse LDC contains a large subcode which is not LTC, while every subcode of an LDC remains LDC. Hence, every nonsparse LDC contains a subcode that is LDC but is not LTC. The above results demonstrate inherent differences between LDCs and LTCs, in particular, they imply that LDCs do not imply LTCs. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/978-3-642-15369-3_50 | APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES |
Keywords | Field | DocType |
decodable code,non-sparse LDC,nonsparse LDC,Hadamard code,Two-transitive code,large subcode,linear code,testable code,corrupted codeword,following result | Discrete mathematics,Locally decodable code,Combinatorics,Low-density parity-check code,Cyclic code,Locally testable code,Code word,Reed–Muller code,Linear code,Hadamard code,Mathematics | Conference |
Volume | ISSN | ISBN |
6302 | 0302-9743 | 3-642-15368-2 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tali Kaufman | 1 | 499 | 38.33 |
| Michael Viderman | 2 | 66 | 6.43 |