An optimal lower bound for 2-query locally decodable linear codes (Q1045948): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2005.11.009
@@ Property / DOI: 10.1016/j.ipl.2005.11.009 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2078058008
@@ Property / OpenAlex ID: W2078058008 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper bound on the communication complexity of private information retrieval
+Normal rank
@@ Property / cites work @@
+Q4535072
@@ Property / cites work: Q4535072 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for adaptive locally decodable codes
@@ Property / cites work: Lower bounds for adaptive locally decodable codes / rank @@
+Normal rank
@@ Property / cites work @@
+On the efficiency of local decoding procedures for error-correcting codes
+Normal rank
@@ Property / cites work @@
+Extractors
@@ Property / cites work: Extractors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4440426
@@ Property / cites work: Q4440426 / rank @@
+Normal rank
@@ Property / cites work @@
+Expander codes
@@ Property / cites work: Expander codes / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2005.11.009
@@ Property / DOI: 10.1016/J.IPL.2005.11.009 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1045948