On the public citation graph
Locally Testable Codes Require Redundant Testers
0 signed · 24 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/tit.2005.851735openalex-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/s0097539796302531openalex-snapshot
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20637openalex-snapshot
A combinatorial characterization of smooth LTCs and applications
inferred← citeshttps://doi.org/10.1007/978-3-319-70503-3_6openalex-snapshot
Zero Knowledge Protocols from Succinct Constraint Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_43openalex-snapshot
Dense Locally Testable Codes Cannot Have Constant Rate and Distance
inferred← citeshttps://doi.org/10.1007/s00037-012-0042-8openalex-snapshot
Towards lower bounds on locally testable codes via density arguments
inferred← citeshttps://doi.org/10.1007/s00037-015-0115-6openalex-snapshot
Sparse affine-invariant linear codes are locally testable
inferred← citeshttps://doi.org/10.1016/j.aim.2025.110117openalex-snapshot
Stability of homomorphisms, coverings and cocycles II: Examples, applications and open problems
inferred← citeshttps://doi.org/10.1103/b9r5-xhcpopenalex-snapshot
Improved energy barrier in higher-dimensional hypergraph product codes
inferred← citeshttps://doi.org/10.1109/ccc.2011.9openalex-snapshot
Towards Lower Bounds on Locally Testable Codes via Density Arguments
inferred← citeshttps://doi.org/10.1109/ccc.2013.34openalex-snapshot
Strong LTCs with Inverse Polylogarithmic Rate and Soundness
inferred← citeshttps://doi.org/10.1109/focs.2012.38openalex-snapshot
Sparse Affine-Invariant Linear Codes Are Locally Testable
inferred← citeshttps://doi.org/10.1109/focs.2013.43openalex-snapshot
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
inferred← citeshttps://doi.org/10.1109/tit.2018.2809788openalex-snapshot
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound
inferred← citeshttps://doi.org/10.1145/1959045.1959062openalex-snapshot
Guest column: testing linear properties
inferred← citeshttps://doi.org/10.1145/2554797.2554807openalex-snapshot
Locally testable codes and cayley graphs
inferred← citeshttps://doi.org/10.1145/3519935.3520024openalex-snapshot
Locally testable codes with constant rate, distance, and locality
inferred← citeshttps://doi.org/10.22331/q-2022-02-24-661openalex-snapshot
Towards local testability for quantum coding
inferred← citeshttps://doi.org/10.48550/arxiv.1012.2738openalex-snapshot
Dense locally testable codes cannot have constant rate and distance
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.