A combination of testability and decodability by tensor products (Q5252263): Difference between revisions

@@ Property / cites work @@
+Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
+Normal rank
@@ Property / cites work @@
+Testing Reed–Muller Codes
@@ Property / cites work: Testing Reed–Muller Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Proof verification and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Probabilistic checking of proofs
@@ Property / cites work: Probabilistic checking of proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved low-degree testing and its applications
@@ Property / cites work: Improved low-degree testing and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Non-deterministic exponential time has two-prover interactive protocols
+Normal rank
@@ Property / cites work @@
+\(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
+Normal rank
@@ Property / cites work @@
+Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
+Normal rank
@@ Property / cites work @@
+Some 3CNF Properties Are Hard to Test
@@ Property / cites work: Some 3CNF Properties Are Hard to Test / rank @@
+Normal rank
@@ Property / cites work @@
+Robust locally testable codes and products of codes
+Normal rank
@@ Property / cites work @@
+Composition of Semi-LTCs by Two-Wise Tensor Products
+Normal rank
@@ Property / cites work @@
+Q3002812
@@ Property / cites work: Q3002812 / rank @@
+Normal rank
@@ Property / cites work @@
+Low Rate Is Insufficient for Local Testability
@@ Property / cites work: Low Rate Is Insufficient for Local Testability / rank @@
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+Normal rank
@@ Property / cites work @@
+Private information retrieval
@@ Property / cites work: Private information retrieval / rank @@
+Normal rank
@@ Property / cites work @@
+The PCP theorem by gap amplification
@@ Property / cites work: The PCP theorem by gap amplification / rank @@
+Normal rank
@@ Property / cites work @@
+Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
+Normal rank
@@ Property / cites work @@
+-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+The tensor product of two good codes is not necessarily robustly testable
+Normal rank
@@ Property / cites work @@
+Locally testable codes and PCPs of almost-linear length
+Normal rank
@@ Property / cites work @@
+List Decoding Tensor Products and Interleaved Codes
+Normal rank
@@ Property / cites work @@
+Linear-Time Encodable/Decodable Codes With Near-Optimal Rate
+Normal rank
@@ Property / cites work @@
+Locally Testable vs. Locally Decodable Codes
@@ Property / cites work: Locally Testable vs. Locally Decodable Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Local list-decoding and testing of random linear codes from high error
+Normal rank
@@ Property / cites work @@
+Algebraic methods for interactive proof systems
@@ Property / cites work: Algebraic methods for interactive proof systems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Construction of Locally Testable Codes
+Normal rank
@@ Property / cites work @@
+On the rectangle method in proofs of robustness of tensor products
+Normal rank
@@ Property / cites work @@
+Two-query PCP with subconstant error
@@ Property / cites work: Two-query PCP with subconstant error / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Coding Theory
@@ Property / cites work: Introduction to Coding Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Nearly-MDS Expander Codes
@@ Property / cites work: Improved Nearly-MDS Expander Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Simple extractors for all min-entropies and a new pseudorandom generator
+Normal rank
@@ Property / cites work @@
+IP = PSPACE
@@ Property / cites work: IP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+IP = SPACE
@@ Property / cites work: IP = SPACE / rank @@
+Normal rank
@@ Property / cites work @@
+Pseudorandom generators without the XOR lemma
@@ Property / cites work: Pseudorandom generators without the XOR lemma / rank @@
+Normal rank
@@ Property / cites work @@
+Towards 3-query locally decodable codes of subexponential length
+Normal rank