Testing algebraic geometric codes

DOI10.1007/S11425-009-0141-4MaRDI QIDQ1047829zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Publication:4863696
• Publication:3495048
• Algebraic geometric codes with applications
• scientific article; zbMATH DE number 5568409
• scientific article; zbMATH DE number 107496
• scientific article; zbMATH DE number 177857
• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes
• On the decoding of algebraic-geometric codes

Cites work

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

Cited in

(5)

• Data stream algorithms for codeword testing (extended abstract)
• Succinct Representation of Codes with Applications to Testing
• 2-transitivity is insufficient for local testability
• Algebraic testing and weight distributions of codes.
• Testing Reed–Muller Codes

This page was built for publication: Testing algebraic geometric codes

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