-
Unique Decoding of Explicit ε-balanced Codes Near the Gilbert-Varshamov Bound
The Gilbert-Varshamov bound (non-constructively) establishes the existen...
11/11/2020 ∙ by Fernando Granha Jeronimo, et al. ∙
0
∙
share
read it
-
List Decoding of Direct Sum Codes
We consider families of codes obtained by "lifting" a base code 𝒞 throug...
11/11/2020 ∙ by Vedat Levi Alev, et al. ∙
0
∙
share
read it
-
Explicit SoS lower bounds from high-dimensional expanders
We construct an explicit family of 3XOR instances which is hard for O(√(...
09/11/2020 ∙ by Irit Dinur, et al. ∙
0
∙
share
read it
-
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders
We consider the problem of approximately solving constraint satisfaction...
07/18/2019 ∙ by Vedat Levi Alev, et al. ∙
0
∙
share
read it
-
Approximating Operator Norms via Generalized Krivine Rounding
We consider the (ℓ_p,ℓ_r)-Grothendieck problem, which seeks to maximize ...
04/10/2018 ∙ by Vijay Bhattiprolu, et al. ∙
0
∙
share
read it
-
Inapproximability of Matrix p→ q Norms
We study the problem of computing the p→ q norm of a matrix A ∈ R^m × n,...
02/21/2018 ∙ by Vijay Bhattiprolu, et al. ∙
0
∙
share
read it
