2000 character limit reached
Testing Tensor Products of Algebraic Codes
Published 30 Oct 2024 in cs.IT and math.IT | (2410.22606v1)
Abstract: Motivated by recent advances in locally testable codes and quantum LDPCs based on robust testability of tensor product codes, we explore the local testability of tensor products of (an abstraction of) algebraic geometry codes. Such codes are parameterized by, in addition to standard parameters such as block length and dimension , their genus . We show that the tensor product of two algebraic geometry codes is robustly locally testable provided . Apart from Reed-Solomon codes, this seems to be the first explicit family of codes of super-constant dual distance that is robustly locally testable.
Paper Prompts
Sign up for free to create and run prompts on this paper.