A novel elementary construction of matching vectors (Q436582): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2012.03.008
+Normal rank
@@ Property / OpenAlex ID @@
+W1999059597
@@ Property / OpenAlex ID: W1999059597 / rank @@
+Normal rank
@@ Property / cites work @@
+On the efficiency of local decoding procedures for error-correcting codes
+Normal rank
@@ Property / cites work @@
+Matching Vector Codes
@@ Property / cites work: Matching Vector Codes / rank @@
+Normal rank
@@ Property / cites work @@
+-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Towards 3-query locally decodable codes of subexponential length
+Normal rank
@@ Property / cites work @@
+Locally Decodable Codes
@@ Property / cites work: Locally Decodable Codes / rank @@
+Normal rank
@@ Property / cites work @@
+Locally Decodable Codes: A Brief Survey
@@ Property / cites work: Locally Decodable Codes: A Brief Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Locally decodable codes and private information retrieval schemes.
+Normal rank
@@ Property / cites work @@
+Introduction to Coding Theory
@@ Property / cites work: Introduction to Coding Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3216750
@@ Property / cites work: Q3216750 / rank @@
+Normal rank
@@ Property / cites work @@
+Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
+Normal rank
@@ Property / cites work @@
+Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
+Normal rank
@@ Property / cites work @@
+Efficient checking of polynomials and proofs and the hardness of approximation problems
+Normal rank
@@ Property / cites work @@
+Nearly-linear size holographic proofs
@@ Property / cites work: Nearly-linear size holographic proofs / rank @@
+Normal rank
@@ Property / cites work @@
+A Geometric Approach to Information-Theoretic Private Information Retrieval
+Normal rank