Testing algebraic geometric codes

DOI10.1007/s11425-009-0141-4zbMath1177.94203OpenAlexW2018032617MaRDI QIDQ1047829

Hao Chen

Publication date: 6 January 2010

Published in: Science in China. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-009-0141-4

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Algebraic function fields and codes
• Self-testing/correcting with applications to numerical problems
• Algebraic testing and weight distributions of codes.
• A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
• Sub-constant error low degree test of almost-linear size
• Testing low-degree polynomials over prime fields
• Short Locally Testable Codes and Proofs
• Linearity testing in characteristic two
• Proof verification and the hardness of approximation problems
• Property testing and its connection to learning and approximation
• Locally testable codes and PCPs of almost-linear length
• Testing Reed–Muller Codes
• Locally Testable Cyclic Codes
• Robust pcps of proximity, shorter pcps and applications to coding
• Some 3CNF properties are hard to test
• Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
• Simple PCPs with poly-log rate and query complexity
• Robust Local Testability of Tensor Products of LDPC Codes
• Probabilistic checking of proofs
• Interactive proofs and the hardness of approximating cliques
• Robust Characterizations of Polynomials with Applications to Program Testing
• Efficient probabilistically checkable proofs and applications to approximations

This page was built for publication: Testing algebraic geometric codes