3 citations · 4 across the 10 of their papers we have counts for
6 papers · 1 filter
Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound
Tushant Mittal, Shashank Srivastava, Madhur Tulsiani +1
We show that for any and any prime , there exists an infinite family of -ary quantum low-density parity-check (QLDPC) codes, rate , checks of weight …
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…
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…
List Decodable Quantum LDPC Codes
Thiago Bergamaschi, Fernando Granha Jeronimo, Tushant Mittal +2
We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial…
Improved List Size for Folded Reed-Solomon Codes
Shashank Srivastava
Folded Reed-Solomon (FRS) codes are variants of Reed-Solomon codes, known for their optimal list decoding radius. We show explicit FRS codes with rate that can be list decoded…
Continuous Optimization for Decoding Errors
Shashank Srivastava
Error-correcting codes are one of the most fundamental objects in pseudorandomness, with applications in communication, complexity theory, and beyond. Codes are useful because of t…