Composition of semi-LTCs by two-wise tensor products (Q496304): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B05
@@ Property / Mathematics Subject Classification ID: 94B05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B60
@@ Property / Mathematics Subject Classification ID: 94B60 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B65
@@ Property / Mathematics Subject Classification ID: 94B65 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6483857
@@ Property / zbMATH DE Number: 6483857 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear codes
@@ Property / zbMATH Keywords: linear codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+locally testable codes
@@ Property / zbMATH Keywords: locally testable codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tensor products
@@ Property / zbMATH Keywords: tensor products / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+expander codes
@@ Property / zbMATH Keywords: expander codes / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00037-013-0074-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2072264369
@@ Property / OpenAlex ID: W2072264369 / rank @@
+Normal rank
@@ Property / cites work @@
+The communication requirements of efficient allocations and supporting prices
+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 @@
+Short PCPs with Polylog Query Complexity
@@ Property / cites work: Short PCPs with Polylog Query Complexity / rank @@
+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 @@
+On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
+Normal rank
@@ Property / cites work @@
+Self-testing/correcting with applications to numerical problems
+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 @@
+Robust Local Testability of Tensor Products of LDPC Codes
+Normal rank
@@ Property / cites work @@
+Q3293678
@@ Property / cites work: Q3293678 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+Short Locally Testable Codes and Proofs
@@ Property / cites work: Short Locally Testable Codes and Proofs / rank @@
+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 @@
+Q3549724
@@ Property / cites work: Q3549724 / rank @@
+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 @@
+High-rate codes with sublinear-time decoding
@@ Property / cites work: High-rate codes with sublinear-time decoding / rank @@
+Normal rank
@@ Property / cites work @@
+Explicit constructions of graphs without short cycles and low density codes
+Normal rank
@@ Property / cites work @@
+Combinatorial Construction of Locally Testable Codes
+Normal rank
@@ Property / cites work @@
+Expander codes
@@ Property / cites work: Expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Some Applications of Coding Theory in Computational Complexity
+Normal rank
@@ Property / cites work @@
+Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / cites work @@
+A Combination of Testability and Decodability by Tensor Products
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:496304