Tushant Mittal

activity

20172026

collaborators

Showing cs.ITShow all

3 papers · 1 filter

cs.IT2026

Random Quantum LDPC Codes Approaching the Gilbert-Varshamov Bound

Tushant Mittal, Shashank Srivastava, Madhur Tulsiani +1

We show that for any $R, ε > 0$ and any prime $p \geq 2$ , there exists an infinite family of $p$ -ary quantum low-density parity-check (QLDPC) codes, rate $R$ , checks of weight $O_{ε} (1)$ …

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 $O (\frac{1}{ε})$ . In contrast to existing explicit constructions o…

cs.IT2024

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…