Algebraic testing and weight distributions of codes.
type: Item
instance of: scholarly article
title: Algebraic testing and weight distributions of codes.
zbMATH Open document ID: 1038.68089
DOI: 10.1016/S0304-3975(02)00816-2
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2003-05-25T00:00:00Z
Mathematics Subject Classification ID: 68T01
zbMATH DE Number: 1915565
zbMATH Keywords: Testing
zbMATH Keywords: MacWilliams Theorems
zbMATH Keywords: Program Checking
zbMATH Keywords: Probabilistically
zbMATH Keywords: Checkable Proofs
MaRDI profile type: Publication
cites work: Q4542552
cites work: Proof verification and the hardness of approximation problems
cites work: Probabilistic checking of proofs
cites work: Q4527016
cites work: Non-deterministic exponential time has two-prover interactive protocols
cites work: Linearity testing in characteristic two
cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results
cites work: Efficient probabilistically checkable proofs and applications to approximations
cites work: Improved non-approximability results
cites work: Designing programs that check their work
cites work: Self-testing/correcting with applications to numerical problems
cites work: Self-Testing without the Generator Bottleneck
cites work: Interactive proofs and the hardness of approximating cliques
cites work: Q4863699
cites work: Q4335195
cites work: Q4224925
cites work: Q4527008
cites work: Property testing and its connection to learning and approximation
cites work: Q4146667
cites work: Q5665102
cites work: Nearly-linear size holographic proofs
cites work: Q4527015
cites work: On the Robustness of Functional Equations
cites work: Robust Characterizations of Polynomials with Applications to Program Testing
cites work: Efficient checking of polynomials and proofs and the hardness of approximation problems
cites work: Q4004139
description: scientific article; zbMATH DE number 1915565