Sparse affine-invariant linear codes are locally testable (Q2012176): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00037-015-0115-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2224258434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of the testable graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extracting Randomness Using Few Independent Sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sums of Locally Testable Affine Invariant Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Testable Codes Require Redundant Testers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some 3CNF Properties Are Hard to Test / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits on the Rate of Locally Testable Affine-Invariant Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002831 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every locally characterized affine-invariant property is testable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified framework for testing linear‐invariant properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph limits and parameter testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: ESTIMATES FOR THE NUMBER OF SUMS AND PRODUCTS AND FOR EXPONENTIAL SUMS IN FIELDS OF PRIME ORDER / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sum-product estimate in finite fields, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Waring's Number in a Finite Field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-Product Estimates Applied to Waring's Problem over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-transitivity is insufficient for local testability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Representation of Codes with Applications to Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Extension of the Weil Bound for Character Sums with Applications to Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local list-decoding and testing of random linear codes from high error / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Green's conjecture and testing linear-invariant properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Latest revision as of 04:22, 14 July 2024

scientific article
Language Label Description Also known as
English
Sparse affine-invariant linear codes are locally testable
scientific article

    Statements

    Sparse affine-invariant linear codes are locally testable (English)
    0 references
    0 references
    0 references
    0 references
    28 July 2017
    0 references
    affine invariance
    0 references
    locally testable codes
    0 references
    sum-product estimates
    0 references
    additive combinatorics
    0 references

    Identifiers