3 citations · 3 across the 17 of their papers we have counts for
5 papers · 1 filter
List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I
Fernando Granha Jeronimo, Aman Singh
We present near-linear time list decoding algorithms (in the block-length ) for expander-based code constructions. More precisely, we show that (i) For every and $ε…
List Decoding of Tanner and Expander Amplified Codes from Distance Certificates
Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani
We develop new list decoding algorithms for Tanner codes and distance-amplified codes based on bipartite spectral expanders. We show that proofs exhibiting lower bounds on the mini…
Unique Decoding of Explicit -balanced Codes Near the Gilbert-Varshamov Bound
Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava +1
The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance and rate (where an upper bound of is know…
List Decoding of Direct Sum Codes
Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana +2
We consider families of codes obtained by "lifting" a base code through operations such as -XOR applied to "local views" of codewords of , according t…
Approximating Constraint Satisfaction Problems on High-Dimensional Expanders
Vedat Levi Alev, Fernando Granha Jeronimo, Madhur Tulsiani
We consider the problem of approximately solving constraint satisfaction problems with arity (-CSPs) on instances satisfying certain expansion properties, when viewed as…