3 papers
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…
cs.IT2024
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…
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…