3 citations · 4 across the 10 of their papers we have counts for
3 papers · 1 filter
Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes
Vikrant Ashvinkumar, Mursalin Habib, Shashank Srivastava
Folded Reed-Solomon (FRS) codes are a well-studied family of codes, known for achieving list decoding capacity. In this work, we give improved deterministic and randomized algorith…
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…
Explicit Codes approaching Generalized Singleton Bound using Expanders
Fernando Granha Jeronimo, Tushant Mittal, Shashank Srivastava +1
We construct a new family of explicit codes that are list decodable to capacity and achieve an optimal list size of . In contrast to existing explicit constructions o…