Matching Vector Codes
An $(r,δ,ε)$-locally decodable code encodes a k-bit message x to an N-bit codeword $C(x)$, such that for every $i∈[k]$, the ith message bit can be recovered with probability $1-ε$, by a randomized decoding procedure that queries only r bits, even if the codeword $C(x)$ is corrupted in up to $δ N$ locations. Recently a new class of locally decodable codes (LDCs), based on families of vectors with restricted dot products, has been discovered. We refer to those codes as matching vector (MV) codes. Several families of $(r,δ,Θ(rδ))$-locally decodable MV codes have been obtained. While codes in those families were shorter than codes of earlier generations, they suffered from having large values of $ε=Ω(rδ)$, which meant that r-query MV codes could only handle error rates below $\frac1r$. Thus larger query complexity gave shorter length codes but at the price of less error tolerance. No MV codes of a superconstant number of queries capable of tolerating a constant fraction of errors were known to exist. In this paper we present a new view of matching vector codes and uncover certain similarities between MV codes and classical Reed–Muller (RM) codes. Our view allows us to obtain deeper insights into the power and limitations of MV codes. Specifically, we obtain the following: (1) We show that existing families of MV codes can be enhanced to tolerate a large constant fraction of errors, independent of the number of queries. Such enhancement comes at a price of a moderate increase in the number of queries. (2) Our construction yields the first families of MV codes of superconstant query complexity that can tolerate a constant fraction of errors. Our codes are shorter than RM LDCs for all values of $r≤\log k/(\log\log k)^c$, for some constant c. (3) We show that any MV code encodes messages of length k to codewords of length at least $k2^Ω(\sqrt\log k)$. Therefore MV codes do not improve upon RM LDCs for $r≥(\log k)^Ω(\sqrt\log k)$.