3 citations · 4 across the 10 of their papers we have counts for
4 papers · 1 filter
List Decoding Expander-Based Codes up to Capacity in Near-Linear Time
Shashank Srivastava, Madhur Tulsiani
We give a new framework based on graph regularity lemmas, for list decoding and list recovery of codes based on spectral expanders. Using existing algorithms for computing regulari…
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…