Near-linear time decoding of Ta-Shma’s codes via splittable regularity

DOI10.1145/3406325.3451126OpenAlexW3171131516MaRDI QIDQ6065272

Fernando Granha Jeronimo, Shashank Srivastava, Madhur Tulsiani

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3406325.3451126

zbMATH Keywords

decoding algorithmregularity decompositionnear-linear timeGV bound

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

List-Decoding with Double Samplers

This page was built for publication: Near-linear time decoding of Ta-Shma’s codes via splittable regularity