Pages that link to "Item:Q862344"
From MaRDI portal
The following pages link to Lower bounds for linear locally decodable codes and private information retrieval (Q862344):
Displaying 22 items.
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- On matrix rigidity and locally self-correctable codes (Q645122) (← links)
- Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
- Locally decodable codes and private information retrieval schemes. (Q983163) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- On coset leader graphs of structured linear codes (Q1985294) (← links)
- Smooth and strong PCPs (Q2029773) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR (Q3603474) (← links)
- Outlaw distributions and locally decodable codes (Q4638069) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002633) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← links)
- Automata, Languages and Programming (Q5716765) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5901095) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- On the optimal communication complexity of error-correcting multi-server PIR (Q6169550) (← links)
