Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > AKASH SENGUPTA:
All reports by Author Akash Sengupta:

TR25-136 | 26th September 2025
Sumegha Garg, Akash Sengupta

Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry Codes

We study the robust local testability of tensor products of two Algebraic-Geometry (AG) codes. In particular, we prove that \textit{constant rate} AG codes are robust locally testable. This significantly generalizes the seminal result of Polishchuk-Spielman [PS24], which proved robust local testability of Reed-Solomon codes. We establish an algebraic-geometric framework ... more >>>




ISSN 1433-8092 | Imprint