On the public citation graph
Symmetric LDPC Codes are not Necessarily Locally Testable
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.
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.1007/978-3-642-03685-9_40openalex-snapshot
Succinct Representation of Codes with Applications to Testing
inferredcites →https://doi.org/10.1007/978-3-642-22670-0_19openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_35openalex-snapshot
Limits on the Rate of Locally Testable Affine-Invariant Codes
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_49openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferredcites →https://doi.org/10.1007/s00037-012-0055-3openalex-snapshot
2-Transitivity is Insufficient for Local Testability
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of 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/ccc.2009.6openalex-snapshot
Locally Testable Codes Require Redundant Testers
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/focs.2011.41openalex-snapshot
New Extension of the Weil Bound for Character Sums with Applications to Coding
inferredcites →https://doi.org/10.1109/sfcs.2005.16openalex-snapshot
Almost Orthogonal Linear Codes are Locally Testable
inferredcites →https://doi.org/10.1137/s0097539704445445openalex-snapshot
Some 3CNF Properties Are Hard to Test
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
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-642-22670-0_19openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_34openalex-snapshot
On Sums of Locally Testable Affine Invariant Properties
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.1007/978-3-642-22935-0_49openalex-snapshot
Proximity Oblivious Testing and the Role of Invariances
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_39openalex-snapshot
Tight Lower Bounds for Testing Linear Isomorphism
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_46openalex-snapshot
Absolutely Sound Testing of Lifted Codes
inferred← citeshttps://doi.org/10.1007/s00037-012-0055-3openalex-snapshot
2-Transitivity is Insufficient for Local Testability
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/focs.2015.56openalex-snapshot
Robust Testing of Lifted Codes with Applications to Low-Degree Testing
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174402openalex-snapshot
Lifted Reed-Solomon Codes with Application to Batch Codes
inferred← citeshttps://doi.org/10.1109/itw46852.2021.9457625openalex-snapshot
On Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2015.2503767openalex-snapshot
High-Rate Locally Correctable Codes via Lifting
inferred← citeshttps://doi.org/10.1109/tit.2021.3116520openalex-snapshot
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1145/1959045.1959062openalex-snapshot
Guest column: testing linear properties
inferred← citeshttps://doi.org/10.1145/2422436.2422494openalex-snapshot
New affine-invariant codes from lifting
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.32657/10356/69693openalex-snapshot
Local correction of codes of high rate
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2016.23openalex-snapshot
On Higher-Order Fourier Analysis over Non-Prime Fields
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5865openalex-snapshot
Graph-based Codes and Generalized Product Constructions
inferred← citeshttps://doi.org/10.70675/30e2ea2cz3cc5z4819zb918zf8338041000dopenalex-snapshot
Codes with locality : constructions and applications to cryptographic protocols
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.