3 citations · 4 across the 10 of their papers we have counts for
12 papers
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…
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…
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…
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…
Unique Decoding of Explicit -balanced Codes Near the Gilbert-Varshamov Bound
Fernando Granha Jeronimo, Dylan Quintana, Shashank Srivastava +1
The Gilbert-Varshamov bound (non-constructively) establishes the existence of binary codes of distance and rate (where an upper bound of is know…
List Decoding of Direct Sum Codes
Vedat Levi Alev, Fernando Granha Jeronimo, Dylan Quintana +2
We consider families of codes obtained by "lifting" a base code through operations such as -XOR applied to "local views" of codewords of , according t…
Modular and fractional L-intersecting families of vector spaces
Rogers Mathew, Tapas Kumar Mishra, Ritabrata Ray +1
In the first part of this paper, we prove a theorem which is the -analogue of a generalized modular Ray-Chaudhuri-Wilson Theorem shown in [Alon, Babai, Suzuki, J. Combin. Theory…
Fractional cross intersecting families
Rogers Mathew, Ritabrata Ray, Shashank Srivastava
Let and be two families of subsets of such that for every and , $|A_{i}\cap B_{j}|= \…