On the public citation graph

Locally Testable Codes Require Redundant Testers

0 signed · 41 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
inferredcites →https://doi.org/10.1007/11538462_40openalex-snapshot
The Tensor Product of Two Codes Is Not Necessarily Robustly Testable
inferredcites →https://doi.org/10.1007/11830924_29openalex-snapshot
Robust Local Testability of Tensor Products of LDPC Codes
inferredcites →https://doi.org/10.1007/11940128_28openalex-snapshot
On 2-Query Codeword Testing with Near-Perfect Completeness
inferredcites →https://doi.org/10.1007/978-3-540-45198-3_19openalex-snapshot
Bounds on 2-Query Codeword Testing
inferredcites →https://doi.org/10.1007/978-3-540-70575-8openalex-snapshot
Automata, Languages and Programming
inferredcites →https://doi.org/10.1007/978-3-540-70575-8_56openalex-snapshot
Sound 3-Query PCPPs Are Long
inferredcites →https://doi.org/10.1007/978-3-642-15369-3_32openalex-snapshot
Low Rate Is Insufficient for Local Testability
inferredcites →https://doi.org/10.1017/cbo9780511808968openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1109/18.119713openalex-snapshot
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
inferredcites →https://doi.org/10.1109/18.556668openalex-snapshot
Linear-time encodable and decodable error-correcting codes
inferredcites →https://doi.org/10.1109/ccc.2008.31openalex-snapshot
2-Transitivity Is Insufficient for Local Testability
inferredcites →https://doi.org/10.1109/focs.2007.65openalex-snapshot
On the Advantage over Random for Maximum Acyclic Subgraph
inferredcites →https://doi.org/10.1109/focs.2007.8openalex-snapshot
Sparse Random Linear Codes are Locally Decodable and Testable
inferredcites →https://doi.org/10.1109/sfcs.2003.1238186openalex-snapshot
Locally testable cyclic codes
inferredcites →https://doi.org/10.1109/tit.2006.872972openalex-snapshot
Upper bounds on the rate of LDPC codes as a function of minimum distance
inferredcites →https://doi.org/10.1137/080729967openalex-snapshot
Combinatorial Construction of Locally Testable Codes
inferredcites →https://doi.org/10.1137/s0097539704445445openalex-snapshot
Some 3CNF Properties Are Hard to Test
inferredcites →https://doi.org/10.1137/s0097539705446810openalex-snapshot
Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
inferredcites →https://doi.org/10.1137/s0097539705446962openalex-snapshot
Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
inferredcites →https://doi.org/10.1137/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
inferredcites →https://doi.org/10.1145/1060590.1060631openalex-snapshot
Simple PCPs with poly-log rate and query complexity
inferredcites →https://doi.org/10.1145/1132516.1132553openalex-snapshot
The PCP theorem by gap amplification
inferredcites →https://doi.org/10.1145/1162349.1162351openalex-snapshot
Locally testable codes and PCPs of almost-linear length
inferredcites →https://doi.org/10.1145/1374376.1374434openalex-snapshot
Algebraic property testing
inferredcites →https://doi.org/10.1145/1595391.1595394openalex-snapshot
Sound 3-Query PCPPs Are Long
inferredcites →https://doi.org/10.1145/273865.273901openalex-snapshot
Probabilistic checking of proofs
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_53openalex-snapshot
Data Stream Algorithms for Codeword Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_32openalex-snapshot
Low Rate Is Insufficient for Local Testability
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_50openalex-snapshot
Locally Testable vs. Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_3openalex-snapshot
Limitation on the Rate of Families of Locally Testable Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-16367-8_6openalex-snapshot
Short Locally Testable Codes and Proofs: A Survey in Two Parts
inferred← citeshttps://doi.org/10.1007/978-3-642-22670-0_25openalex-snapshot
Short Locally Testable Codes and Proofs
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_35openalex-snapshot
Limits on the Rate of Locally Testable Affine-Invariant Codes
inferred← citeshttps://doi.org/10.1038/s41467-024-55570-7openalex-snapshot
Quantum memory at nonzero temperature in a thermodynamically trivial system
inferred← citeshttps://doi.org/10.1109/ccc.2011.14openalex-snapshot
Symmetric LDPC Codes are not Necessarily Locally Testable
inferred← citeshttps://doi.org/10.1109/icmse.2011.6070099openalex-snapshot
Reseach of security risk identification based on rough set theory for highway subgrade stability in the slope of reservoir
inferred← citeshttps://doi.org/10.1145/2488608.2488714openalex-snapshot
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
inferred← citeshttps://doi.org/10.22331/q-2025-10-07-1879openalex-snapshot
Single-shot preparation of hypergraph product codes via dimension jump
inferred← citeshttps://doi.org/10.48550/arxiv.1004.4601openalex-snapshot
Data Stream Algorithms for Codeword Testing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.