On the public citation graph

The Tensor Product of Two Codes Is Not Necessarily Robustly 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.
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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/istcs.1995.377032openalex-snapshot
Some improvements to total degree tests
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/1007352.1007361openalex-snapshot
Robust pcps of proximity, shorter pcps and applications to coding
inferredcites →https://doi.org/10.1145/1060590.1060631openalex-snapshot
Simple PCPs with poly-log rate and query complexity
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/258533.258641openalex-snapshot
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
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.1002/rsa.20120openalex-snapshot
Robust Locally Testable Codes and Products of Codes
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/11830924_29openalex-snapshot
Robust Local Testability of Tensor Products of LDPC Codes
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-32512-0_55openalex-snapshot
A Combination of Testability and Decodability by Tensor Products
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.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.1109/ccc.2009.6openalex-snapshot
Locally Testable Codes Require Redundant Testers
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.42openalex-snapshot
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
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/focs.2017.27openalex-snapshot
Local List Recovery of High-Rate Tensor Codes & Applications
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00083openalex-snapshot
Local Proofs Approaching the Witness Length [Extended Abstract]
inferred← citeshttps://doi.org/10.1109/tit.2020.3023962openalex-snapshot
On List Recovery of High-Rate Tensor Codes
inferred← citeshttps://doi.org/10.1137/080729967openalex-snapshot
Combinatorial Construction of Locally Testable Codes
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/2488608.2488714openalex-snapshot
A new family of locally correctable codes based on degree-lifted algebraic geometry codes
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/2901294openalex-snapshot
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
inferred← citeshttps://doi.org/10.1145/2993749.2993760openalex-snapshot
SIGACT News Complexity Theory Column 93
inferred← citeshttps://doi.org/10.1145/2993749.2993761openalex-snapshot
Guest Column
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.4086/toc.2009.v005a012openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a005openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2020.v016a018openalex-snapshot
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.