Algebraic testing and weight distributions of codes.

DOI10.1016/S0304-3975(02)00816-2MaRDI QIDQ1874387zbMATH OpenFDO

Authors Yanyan Li

Publication date 25 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00816-2

zbMATH Keywords

Checkable ProofsMacWilliams TheoremsProbabilisticallyProgram CheckingTesting

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Recommendations

• Optimal testing of Reed-Muller codes
• Testing algebraic geometric codes
• Linearity testing in characteristic two
• scientific article; zbMATH DE number 1003235
• Low-degree tests at large distances

Cites work

• Designing programs that check their work
• Efficient checking of polynomials and proofs and the hardness of approximation problems
• Efficient probabilistically checkable proofs and applications to approximations
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• scientific article; zbMATH DE number 53945 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1241385 (Why is no real title available?)
• scientific article; zbMATH DE number 1003235 (Why is no real title available?)
• scientific article; zbMATH DE number 1559556 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• scientific article; zbMATH DE number 1559564 (Why is no real title available?)
• scientific article; zbMATH DE number 1775419 (Why is no real title available?)
• scientific article; zbMATH DE number 837790 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• Improved non-approximability results
• Interactive proofs and the hardness of approximating cliques
• Linearity testing in characteristic two
• Nearly-linear size holographic proofs
• Non-deterministic exponential time has two-prover interactive protocols
• On the Robustness of Functional Equations
• Probabilistic checking of proofs
• Proof verification and the hardness of approximation problems
• Property testing and its connection to learning and approximation
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-Testing without the Generator Bottleneck
• Self-testing/correcting with applications to numerical problems

Cited in

(7)

• Testing algebraic geometric codes
• Direct sum testing (extended abstract)
• Linearity testing in characteristic two
• Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
• Tolerant Linearity Testing and Locally Testable Codes
• scientific article; zbMATH DE number 1751828 (Why is no real title available?)
• Direct sum testing

This page was built for publication: Algebraic testing and weight distributions of codes.

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