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 TR18-195 | 26th February 2021 09:28

Erasures versus Errors in Local Decoding and Property Testing

RSS-Feed




Revision #1
Authors: Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
Accepted on: 26th February 2021 09:28
Downloads: 65
Keywords: 


Abstract:

We initiate the study of the role of erasures in local decoding and use our understanding to prove a separation between erasure-resilient and tolerant property testing. We first investigate local list-decoding in the presence of erasures. We prove an analog of a famous result of Goldreich and Levin on local list-decodability of the Hadamard code. Specifically, we show that the Hadamard code is locally list-decodable in the presence of a constant fraction of erasures, arbitrarily close to 1, with list sizes and query complexity better than in the Goldreich-Levin theorem. We further study approximate locally erasure list-decodable codes and use them to construct a property that is erasure-resiliently testable with query complexity independent of the input length, $n$, but requires $n^{\Omega(1)}$ queries for tolerant testing. We also investigate the general relationship between local decoding in the presence of errors and in the presence of erasures.



Changes to previous version:

Major revisions in writing and presentation


Paper:

TR18-195 | 18th November 2018 19:47

Erasures versus Errors in Local Decoding and Property Testing


Abstract:

We initiate the study of the role of erasures in local decoding and use our understanding to prove a separation between erasure-resilient and tolerant property testing. Local decoding in the presence of errors has been extensively studied, but has not been considered explicitly in the presence of erasures.

Motivated by applications in property testing, we begin our investigation with local list decoding in the presence of erasures. We prove an analog of a famous result of Goldreich and Levin on local list decodability of the Hadamard code. Specifically, we show that the Hadamard code is locally list decodable in the presence of a constant fraction of erasures, arbitrary close to 1, with list sizes and query complexity better than in the Goldreich-Levin theorem. We use this result to exhibit a property which is testable with a number of queries independent of the length of the input in the presence of erasures, but requires a number of queries that depends on the input length, n, for tolerant testing. We further study approximate locally list decodable codes that work against erasures and use them to strengthen our separation by constructing a property which is testable with a constant number of queries in the presence of erasures, but requires n^{Omega(1)} queries for tolerant testing.

Next, we study the general relationship between local decoding in the presence of errors and in the presence of erasures. We observe that every locally (uniquely or list) decodable code that works in the presence of errors also works in the presence of twice as many erasures (with the same parameters up to constant factors). We show that there is also an implication in the other direction for locally decodable codes (with unique decoding): specifically, that the existence of a locally decodable code that works in the presence of erasures implies the existence of a locally decodable code that works in the presence of errors and has related parameters. However, it remains open whether there is an implication in the other direction for locally list decodable codes. We relate this question to other open questions in local decoding.



ISSN 1433-8092 | Imprint