Given two binary linear codes R and C, their tensor product R C consists of all matrices with rows in R and columns in C. We analyze the "robustness" of the following te...
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...