3 papers
cs.IT2025
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…
quant-ph2024
The Power of Unentangled Quantum Proofs with Non-negative Amplitudes
Fernando Granha Jeronimo, Pei Wu
Quantum entanglement is a fundamental property of quantum mechanics and plays a crucial role in quantum computation and information. We study entanglement via the lens of computati…
cs.DS2023
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…