3 citations · 5 across the 21 of their papers we have counts for
5 papers · 1 filter
Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes
Fernando Granha Jeronimo, Nikhil Shagrithaya
We present a general framework for derandomizing random linear codes with respect to a broad class of properties, known as local properties, which encompass several standard notion…
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 $ε…
Pseudorandomness of Expander Walks via Fourier Analysis on Groups
Fernando Granha Jeronimo, Tushant Mittal, Sourya Roy
One approach to study the pseudorandomness properties of walks on expander graphs is to label the vertices of an expander with elements from an alphabet , and study the mean of…
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…
Higher-order Delsarte Dual LPs: Lifting, Constructions and Completeness
Leonardo Nagami Coregliano, Fernando Granha Jeronimo, Chris Jones +2
A central and longstanding open problem in coding theory is the rate-versus-distance trade-off for binary error-correcting codes. In a seminal work, Delsarte introduced a family of…