On the public citation graph
Combinatorial Construction of Locally Testable Codes
0 signed · 71 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.1002/j.1538-7305.1952.tb01393.xopenalex-snapshot
A Comparison of Signalling Alphabets
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.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/0304-3975(94)90251-8openalex-snapshot
On the power of multi-prover interactive protocols
inferredcites →https://doi.org/10.1090/s0273-0979-06-01126-8openalex-snapshot
Expander graphs and their applications
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/focs.2007.65openalex-snapshot
On the Advantage over Random for Maximum Acyclic Subgraph
inferredcites →https://doi.org/10.1137/050646445openalex-snapshot
Short PCPs with Polylog Query Complexity
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/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
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/195058.195132openalex-snapshot
Nearly-linear size holographic proofs
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
inferredcites →https://doi.org/10.2307/3062153openalex-snapshot
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
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.20498openalex-snapshot
A combination of testability and decodability by tensor products
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-031-88946-2_10openalex-snapshot
On the Locally Testable Code of Dinur et al. (2021)
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_24openalex-snapshot
Tensor Products of Weakly Smooth Codes Are Robust
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_29openalex-snapshot
Composition of Semi-LTCs by Two-Wise Tensor Products
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_45openalex-snapshot
Tolerant Linearity Testing and Locally Testable Codes
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_25openalex-snapshot
Symmetric LDPC Codes and Local Testing
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_43openalex-snapshot
Dense Locally Testable Codes Cannot Have Constant Rate and Distance
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_707-1openalex-snapshot
Locally Testable Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-32512-0_55openalex-snapshot
A Combination of Testability and Decodability by Tensor Products
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_42openalex-snapshot
Zero Knowledge LTCs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-54242-8_6openalex-snapshot
Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
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-013-0074-8openalex-snapshot
Composition of semi-LTCs by two-wise tensor products
inferred← citeshttps://doi.org/10.1007/s00493-014-2715-1openalex-snapshot
Symmetric LDPC codes and local testing
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.11.007openalex-snapshot
On the rectangle method in proofs of robustness of tensor products
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.01.007openalex-snapshot
The tensor product of two good codes is not necessarily robustly testable
inferred← citeshttps://doi.org/10.1017/9781108135252openalex-snapshot
Introduction to Property Testing
inferred← citeshttps://doi.org/10.1109/ccc.2009.6openalex-snapshot
Locally Testable Codes Require Redundant Testers
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.2013.43openalex-snapshot
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
inferred← citeshttps://doi.org/10.1109/focs.2017.27openalex-snapshot
Local List Recovery of High-Rate Tensor Codes & Applications
inferred← citeshttps://doi.org/10.1109/tit.2020.3023962openalex-snapshot
On List Recovery of High-Rate Tensor Codes
inferred← citeshttps://doi.org/10.1137/090779875openalex-snapshot
Locally Testable Codes Require Redundant Testers
inferred← citeshttps://doi.org/10.1137/1.9781611975994.83openalex-snapshot
On the Power of Relaxed Local Decoding Algorithms
inferred← citeshttps://doi.org/10.1137/17m116149xopenalex-snapshot
Local List Recovery of High-Rate Tensor Codes and Applications
inferred← citeshttps://doi.org/10.1137/19m1307834openalex-snapshot
On the Power of Relaxed Local Decoding Algorithms
inferred← citeshttps://doi.org/10.1145/1536414.1536419openalex-snapshot
List decoding tensor products and interleaved codes
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/2897518.2897523openalex-snapshot
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
inferred← citeshttps://doi.org/10.1145/2993749.2993760openalex-snapshot
SIGACT News Complexity Theory Column 93
inferred← citeshttps://doi.org/10.1145/3016802openalex-snapshot
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs
inferred← citeshttps://doi.org/10.1145/3051093openalex-snapshot
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
inferred← citeshttps://doi.org/10.1145/3519935.3520024openalex-snapshot
Locally testable codes with constant rate, distance, and locality
inferred← citeshttps://doi.org/10.1145/3618260.3649611openalex-snapshot
Relaxed Local Correctability from Local Testing
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.