Algebraic testing and weight distributions of codes.

DOI10.1016/S0304-3975(02)00816-2zbMath1038.68089MaRDI QIDQ1874387

Yanyan Li

Publication date: 25 May 2003

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

zbMATH Keywords

TestingCheckable ProofsMacWilliams TheoremsProbabilisticallyProgram Checking

Mathematics Subject Classification ID

General topics in artificial intelligence (68T01)

Related Items (2)

Breaking the ε-Soundness Bound of the Linearity Test over GF(2) ⋮ Testing algebraic geometric codes

Cites Work

• Non-deterministic exponential time has two-prover interactive protocols
• Self-testing/correcting with applications to numerical problems
• Efficient checking of polynomials and proofs and the hardness of approximation problems
• Improved non-approximability results
• Nearly-linear size holographic proofs
• Linearity testing in characteristic two
• Proof verification and the hardness of approximation problems
• Property testing and its connection to learning and approximation
• Probabilistic checking of proofs
• On the Robustness of Functional Equations
• Designing programs that check their work
• Interactive proofs and the hardness of approximating cliques
• Free Bits, PCPs, and Nonapproximability---Towards Tight Results
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-Testing without the Generator Bottleneck
• Efficient probabilistically checkable proofs and applications to approximations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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