On the public citation graph
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
0 signed · 107 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.1950.tb00463.xopenalex-snapshot
Error Detecting and Error Correcting Codes
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.20498openalex-snapshot
A combination of testability and decodability by tensor products
inferredcites →https://doi.org/10.1006/jcss.2000.1730openalex-snapshot
Pseudorandom Generators without the XOR Lemma
inferredcites →https://doi.org/10.1007/11523468_115openalex-snapshot
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
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/3-540-52282-4_44openalex-snapshot
Efficient checking of computations
inferredcites →https://doi.org/10.1007/978-3-642-22670-0openalex-snapshot
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation
inferredcites →https://doi.org/10.1007/978-3-642-22935-0_43openalex-snapshot
Dense Locally Testable Codes Cannot Have Constant Rate and Distance
inferredcites →https://doi.org/10.1007/978-3-662-47672-7_57openalex-snapshot
Linear-Time List Recovery of High-Rate Expander Codes
inferredcites →https://doi.org/10.1007/bf01275486openalex-snapshot
BPP has subexponential time simulations unlessEXPTIME has publishable proofs
inferredcites →https://doi.org/10.1007/s00037-012-0042-8openalex-snapshot
Towards lower bounds on locally testable codes via density arguments
inferredcites →https://doi.org/10.1007/s00037-013-0074-8openalex-snapshot
Composition of semi-LTCs by two-wise tensor products
inferredcites →https://doi.org/10.1016/0012-365x(88)90189-6openalex-snapshot
Explicit construction of linear sized tolerant networks
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
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/0095-8956(85)90092-9openalex-snapshot
λ1, Isoperimetric inequalities for graphs, and superconcentrators
inferredcites →https://doi.org/10.1016/j.ic.2014.12.013openalex-snapshot
Local correctability of expander codes
inferredcites →https://doi.org/10.1016/j.ipl.2011.11.007openalex-snapshot
On the rectangle method in proofs of robustness of tensor products
inferredcites →https://doi.org/10.1016/j.ipl.2012.01.007openalex-snapshot
The tensor product of two good codes is not necessarily robustly testable
inferredcites →https://doi.org/10.1090/conm/625/12497openalex-snapshot
Some remarks on multiplicity codes
inferredcites →https://doi.org/10.1090/s0002-9947-1984-0743744-xopenalex-snapshot
Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
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/18.556669openalex-snapshot
A linear time erasure-resilient code with nearly optimal recovery
inferredcites →https://doi.org/10.1109/ccc.2008.7openalex-snapshot
Locally Decodable Codes From Nice Subsets of Finite Fields and Prime Factors of Mersenne Numbers
inferredcites →https://doi.org/10.1109/ccc.2013.34openalex-snapshot
Strong LTCs with Inverse Polylogarithmic Rate and Soundness
inferredcites →https://doi.org/10.1109/focs.2013.43openalex-snapshot
Strong LTCs with Inverse Poly-Log Rate and Constant Soundness
inferredcites →https://doi.org/10.1109/istcs.1995.377032openalex-snapshot
Some improvements to total degree tests
inferredcites →https://doi.org/10.1109/sfcs.2003.1238187openalex-snapshot
List-decoding using the XOR lemma
inferredcites →https://doi.org/10.1109/tit.1964.1053661openalex-snapshot
Maximum distanceq-nary codes
inferredcites →https://doi.org/10.1109/tit.1966.1053873openalex-snapshot
Generalized minimum distance decoding
inferredcites →https://doi.org/10.1109/tit.2005.855587openalex-snapshot
Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
inferredcites →https://doi.org/10.1109/tit.2007.911222openalex-snapshot
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/050646445openalex-snapshot
Short PCPs with Polylog Query Complexity
inferredcites →https://doi.org/10.1137/080729967openalex-snapshot
Combinatorial Construction of Locally Testable Codes
inferredcites →https://doi.org/10.1137/090772721openalex-snapshot
3-Query Locally Decodable Codes of Subexponential Length
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/103418.103428openalex-snapshot
Checking computations in polylogarithmic time
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/1326554.1326555openalex-snapshot
Towards 3-query locally decodable codes of subexponential length
inferredcites →https://doi.org/10.1145/1391289.1391291openalex-snapshot
Undirected connectivity in log-space
inferredcites →https://doi.org/10.1145/1993636.1993660openalex-snapshot
High-rate codes with sublinear-time decoding
inferredcites →https://doi.org/10.1145/200836.200880openalex-snapshot
Designing programs that check their work
inferredcites →https://doi.org/10.1145/2422436.2422494openalex-snapshot
New affine-invariant codes from lifting
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.1145/335305.335315openalex-snapshot
On the efficiency of local decoding procedures for error-correcting codes
inferredcites →https://doi.org/10.1145/509907.510023openalex-snapshot
Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets
inferredcites →https://doi.org/10.2307/3062153openalex-snapshot
Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders
inferredcites →https://doi.org/10.5555/1133618.1133623openalex-snapshot
Robust locally testable codes and products of codes
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.21031openalex-snapshot
Erasures versus errors in local decoding and property testing
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_691openalex-snapshot
Large-Treewidth Graph Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-031-14791-3_3openalex-snapshot
Memory-Hard Puzzles in the Standard Model with Applications to Memory-Hard Functions and Resource-Bounded Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-88946-2_11openalex-snapshot
On the Lower Bound on the Length of Relaxed Locally Decodable Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-88946-2_12openalex-snapshot
On the Relaxed LDC of BGHSV: A Survey that Corrects the Record
inferred← citeshttps://doi.org/10.1109/focs.2018.00029openalex-snapshot
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00083openalex-snapshot
Local Proofs Approaching the Witness Length [Extended Abstract]
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00102openalex-snapshot
Nearly Optimal Pseudorandomness From Hardness
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00077openalex-snapshot
Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00010openalex-snapshot
Relaxed Locally Decodable and Correctable Codes: Beyond Tensoring
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00060openalex-snapshot
Chernoff Bounds and Reverse Hypercontractivity on HDX
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00094openalex-snapshot
Tight Bounds for the Zig-Zag Product
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00112openalex-snapshot
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
inferred← citeshttps://doi.org/10.1109/isit.2018.8437593openalex-snapshot
On Taking Advantage of Multiple Requests in Error Correcting Codes
inferred← citeshttps://doi.org/10.1109/isit.2019.8849322openalex-snapshot
Relaxed Locally Correctable Codes in Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518249openalex-snapshot
Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206655openalex-snapshot
Computationally Relaxed Locally Decodable Codes, Revisited
inferred← citeshttps://doi.org/10.1109/itaic.2019.8785548openalex-snapshot
Asymptotically Good Codes Obtained by an Extended Primitive BCH Code Concatenated with Interleaved Codes
inferred← citeshttps://doi.org/10.1109/itw46852.2021.9457625openalex-snapshot
On Lifted Multiplicity Codes
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.1109/tit.2020.3023962openalex-snapshot
On List Recovery of High-Rate Tensor Codes
inferred← citeshttps://doi.org/10.1109/tit.2021.3076396openalex-snapshot
Relaxed Locally Correctable Codes in Computationally Bounded Channels
inferred← citeshttps://doi.org/10.1109/tit.2021.3116520openalex-snapshot
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3503500openalex-snapshot
Tradeoff Constructions for Quantum Locally Testable Codes
inferred← citeshttps://doi.org/10.1109/tit.2025.3625861openalex-snapshot
List-Recovery of Random Linear Codes Over Small Fields
inferred← citeshttps://doi.org/10.1137/1.9781611975031.69openalex-snapshot
A Two-pronged Progress in Structured Dense Matrix Vector Multiplication
inferred← citeshttps://doi.org/10.1137/17m116149xopenalex-snapshot
Local List Recovery of High-Rate Tensor Codes and Applications
inferred← citeshttps://doi.org/10.1137/19m124647xopenalex-snapshot
Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs
inferred← citeshttps://doi.org/10.1137/19m1276650openalex-snapshot
List-Decoding with Double Samplers
inferred← citeshttps://doi.org/10.1137/20m1370215openalex-snapshot
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes
inferred← citeshttps://doi.org/10.1137/24m1687169openalex-snapshot
Relaxed Local Correctability from Local Testing
inferred← citeshttps://doi.org/10.1145/2993749.2993760openalex-snapshot
SIGACT News Complexity Theory Column 93
inferred← citeshttps://doi.org/10.1145/3406325.3451049openalex-snapshot
Expander random walks: a Fourier-analytic approach
inferred← citeshttps://doi.org/10.1145/3519935.3520024openalex-snapshot
Locally testable codes with constant rate, distance, and locality
inferred← citeshttps://doi.org/10.1145/3555307openalex-snapshot
Nearly Optimal Pseudorandomness from Hardness
inferred← citeshttps://doi.org/10.1145/3618260.3649611openalex-snapshot
Relaxed Local Correctability from Local Testing
inferred← citeshttps://doi.org/10.1145/3661483openalex-snapshot
Local Proofs Approaching the Witness Length
inferred← citeshttps://doi.org/10.1145/3717823.3718132openalex-snapshot
Time and Space Efficient Deterministic Decoders
inferred← citeshttps://doi.org/10.1145/3732772.3733536openalex-snapshot
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
inferred← citeshttps://doi.org/10.1145/3767145.3767151openalex-snapshot
SIGACT News Complexity Theory Column 126 Locally Decodable Codes for Insertions and Deletions
inferred← citeshttps://doi.org/10.1145/3798129.3800886openalex-snapshot
High Rate Efficient Local List Decoding from HDX
inferred← citeshttps://doi.org/10.1561/0400000085openalex-snapshot
Complexity Theory, Game Theory, and Economics: The Barbados Lectures
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.43openalex-snapshot
Expander Random Walks: The General Case and Limitations
inferred← citeshttps://doi.org/10.4230/lipics.itc.2020.16openalex-snapshot
On Locally Decodable Codes in Resource Bounded Channels
inferred← citeshttps://doi.org/10.48550/arxiv.2010.11989openalex-snapshot
Locally Decodable/Correctable Codes for Insertions and Deletions
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.