Near-linear time decoding of ta-shma’s codes via splittable regularity FG Jeronimo, S Srivastava, M Tulsiani
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
36 2021 List decoding of direct sum codes VL Alev, FG Jeronimo, D Quintana, S Srivastava, M Tulsiani
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2020
28 2020 Unique Decoding of Explicit FG Jeronimo, D Quintana, S Srivastava, M Tulsiani
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
24 2020 Improved list size for folded reed-solomon codes S Srivastava
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
5 2025 List decoding of tanner and expander amplified codes from distance certificates FG Jeronimo, S Srivastava, M Tulsiani
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS …, 2023
5 * 2023 Modular and fractional L-intersecting families of vector spaces R Mathew, TK Mishra, R Ray, S Srivastava
The Electronic Journal of Combinatorics 29 (1), 2022
4 2022 Fractional cross intersecting families R Mathew, R Ray, S Srivastava
Graphs and Combinatorics 37, 471-484, 2021
4 2021 Continuous Optimization for Decoding Errors S Srivastava
arXiv preprint arXiv:2408.14652, 2024
2 2024 Explicit Codes approaching Generalized Singleton Bound using Expanders FG Jeronimo, T Mittal, S Srivastava, M Tulsiani
arXiv preprint arXiv:2502.07308, 2025
2025 List Decodable Quantum LDPC Codes T Bergamaschi, FG Jeronimo, T Mittal, S Srivastava, M Tulsiani
arXiv preprint arXiv:2411.04306, 2024
2024 