On Sums of Locally Testable Affine Invariant Properties

No abstract is available for this paper.

• Publication year

  2011

• Venue

  International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

• Publication date

  2011-08-17

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/978-3-642-22935-0_34
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the degree of univariate polynomials over the integers

  2012cited by this paper
• Limits on the Rate of Locally Testable Affine-Invariant Codes

  2011cited by this paper
• Symmetric LDPC Codes are not Necessarily Locally Testable

  2011cited by this paper
• Testing of exponentially large codes, by a new extension to Weil bound for character sums

  2010cited by this paper
• Invariance in Property Testing

  2010cited by this paper
• A Unified Framework for Testing Linear-Invariant Properties

  2010cited by this paper
• Local list-decoding and testing of random linear codes from high error

  2010cited by this paper
• On Locally Decodable Codes, Self-Correctable Codes, and t-Private PIR

  2010cited by this paper
• Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes

  2010cited by this paper
• The Complexity of Boolean Functions in Different Characteristics

  2009cited by this paper
• Succinct Representation of Codes with Applications to Testing

  2009cited by this paper
• Algebraic property testing: the role of invariance

  2008cited by this paper
• A removal lemma for systems of linear equations over finite fields

  2008cited by this paper
• A proof of Green's conjecture regarding the removal properties of sets of linear equations

  2008cited by this paper
• 2-Transitivity is Insufficient for Local Testability

  2008cited by this paper
• Testing Linear-Invariant Non-Linear Properties

  2008cited by this paper
• Sparse Random Linear Codes are Locally Decodable and Testable

  2007cited by this paper
• A combinatorial characterization of the testable graph properties: it's all about regularity

  2006cited by this paper
• Graph limits and parameter testing

  2006cited by this paper
• Almost orthogonal linear codes are locally testable

  2005cited by this paper
• Testing Reed-Muller codes

  2005cited by this paper
• Testing low-degree polynomials over prime fields

  2004cited by this paper
• Testing polynomials over general fields

  2004cited by this paper
• On the efficiency of local decoding procedures for error-correcting codes

  2000cited by this paper
• Probabilistic checking of proofs: a new characterization of NP

  1998cited by this paper
• Robust Characterizations of Polynomials with Applications to Program Testing

  1996cited by this paper
• Property testing and its connection to learning and approximation

  1996cited by this paper
• Private information retrieval

  1995cited by this paper
• Proof verification and hardness of approximation problems

  1992cited by this paper
• Fast Probabilistic Algorithms for Verification of Polynomial Identities

  1980cited by this paper
• Probabilistic algorithms for sparse polynomials

  1979cited by this paper
• The orders of the linear groups

  1955cited by this paper

• Decoding of Lifted Affine-Invariant Codes

  2020cites this paper
• A combinatorial characterization of smooth LTCs and applications

  2016cites this paper
• Multi-variate Abstractions of Algebraic Geometry Codes, With Applications

  2016cites this paper
• Robust Testing of Lifted Codes with Applications to Low-Degree Testing

  2015cites this paper
• New error correcting codes from lifting

  2015cites this paper
• Additive combinatorics methods in computational complexity

  2014cites this paper
• List-Decoding Algorithms for Lifted Codes

  2014cites this paper
• A new family of locally correctable codes based on degree-lifted algebraic geometry codes

  2013cites this paper
• Strong LTCs with Inverse Poly-Log Rate and Constant Soundness

  2013cites this paper
• Tight Lower Bounds for Testing Linear Isomorphism

  2013influential citation
• Absolutely Sound Testing of Lifted Codes

  2013cites this paper
• A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes

  2012cites this paper
• New affine-invariant codes from lifting

  2012cites this paper
• Some closure features of locally testable affine-invariant properties

  2012cites this paper
• Explicit Low-Weight Bases for BCH Codes

  2012cites this paper
• Sparse affine-invariant linear codes are locally testable

  2012cites this paper
• Testing Linear Properties: Some general themes

  2011cites this paper
• Open Problems in Data Streams, Property Testing, and Related Topics

  2011cites this paper
• Guest column: testing linear properties: some general theme

  2011cites this paper