Testing tensor products of algebraic codes

DOI10.4230/LIPICS.APPROX/RANDOM.2025.59MaRDI QIDQ7346892zbMATH OpenFDO

Authors Sumegha Garg, Madhu Sudan, Gabriel Shui Tang Wu

Publication date 11 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2025.59

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A combination of testability and decodability by tensor products
• Algebraic function fields and codes
• Algebraic property testing: the role of invariance
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Asymptotically good Quantum and locally testable classical LDPC codes
• Combinatorial construction of locally testable codes
• Error-locating pairs for cyclic codes
• Good quantum LDPC codes with linear time decoders
• scientific article; zbMATH DE number 1284423 (Why is no real title available?)
• Locally Testable Codes Require Redundant Testers
• Locally testable codes with constant rate, distance, and locality
• Nearly-linear size holographic proofs
• On decoding by error location and dependent sets of error positions
• On representations of algebraic-geometry codes
• Primes of the Form 𝑥²+𝑛𝑦²
• Probabilistic checking of proofs
• Quantum Tanner codes
• Robust Characterizations of Polynomials with Applications to Program Testing
• Robust Local Testability of Tensor Products of LDPC Codes
• Robust locally testable codes and products of codes
• Strong LTCs with inverse poly-log rate and constant soundness
• The tensor product of two good codes is not necessarily robustly testable

This page was built for publication: Testing tensor products of algebraic codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346892)