Sparse affine-invariant linear codes are locally testable
type: Item
instance of: scholarly article
title: Sparse affine-invariant linear codes are locally testable
zbMATH Open document ID: 1381.94114
author: Eli Ben-Sasson
author: Noga Ron-Zewi
author: Madhu Sudan
published in: Computational Complexity
publication date: 2017-07-28T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 68W20
Mathematics Subject Classification ID: 11B30
zbMATH DE Number: 6754724
zbMATH Keywords: affine invariance
zbMATH Keywords: locally testable codes
zbMATH Keywords: sum-product estimates
zbMATH Keywords: additive combinatorics
MaRDI profile type: Publication
full work available at URL: s00037-015-0115-6
OpenAlex ID: W2224258434
cites work: A combinatorial characterization of the testable graph properties
cites work: Extracting Randomness Using Few Independent Sources
cites work: On Sums of Locally Testable Affine Invariant Properties
cites work: Locally Testable Codes Require Redundant Testers
cites work: Some 3CNF Properties Are Hard to Test
cites work: Limits on the Rate of Locally Testable Affine-Invariant Codes
cites work: Q3002831
cites work: Every locally characterized affine-invariant property is testable
cites work: A unified framework for testing linear‐invariant properties
cites work: Graph limits and parameter testing
cites work: ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER
cites work: A sum-product estimate in finite fields, and applications
cites work: Waring's Number in a Finite Field
cites work: Sum-product estimates applied to Waring's problem over finite fields
cites work: 2-transitivity is insufficient for local testability
cites work: Succinct Representation of Codes with Applications to Testing
cites work: New Extension of the Weil Bound for Character Sums with Applications to Coding
cites work: Q3549724
cites work: Local list-decoding and testing of random linear codes from high error
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Green's conjecture and testing linear-invariant properties
cites work: Q3851616
DOI: 10.1007/S00037-015-0115-6
description: scientific article; zbMATH DE number 6754724