Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR10-119 | 27th July 2010 17:14

Distance Estimators with Sublogarithmic Number of Queries


Authors: Michal Moshkovitz
Publication: 27th July 2010 17:24
Downloads: 3285


A distance estimator is a code together with a randomized algorithm. The algorithm approximates the distance of any word from the code by making a small number of queries to the word. One such example is the Reed-Muller code equipped with an appropriate algorithm. It has polynomial length, polylogarithmic alphabet size, and polylogarithmic number of queries. In our work we present two results. First, we construct a distance estimator with arbitrary small alphabet size, polynomial length, and polylogarithmic number of queries. Second, we construct a distance estimator with sublogarithmic number of queries, almost linear length, and polylogarithmic alphabet size.

Distance estimators are the coding theoretical analog of two-query low-error PCP. A recent work by Moshkovitz and Raz [FOCS'08]established two-query low-error PCP for the first time. In this work we examine whether we can construct a distance estimator via the new technique for PCP. Perhaps surprisingly, the new technique illuminates the difference between codes and PCP; there is an inherent problem with using the technique in the same way that was done for PCP. However, as we see in this work, the technique can be used to construct a distance estimator (up to a point).

To prove our results, we develop a general scheme for showing that a combinatorial operation preserves the distance estimator property.

ISSN 1433-8092 | Imprint