Pages that link to "Item:Q5716765"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716765):
Displaying 16 items.
- On locally decodable codes, self-correctable codes, and \(t\)-private PIR (Q603915) (← links)
- Lower bounds for linear locally decodable codes and private information retrieval (Q862344) (← links)
- Locally decodable codes and private information retrieval schemes. (Q983163) (← links)
- An optimal lower bound for 2-query locally decodable linear codes (Q1045948) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← links)
- General constructions for information-theoretic private information retrieval (Q2485285) (← links)
- Information-Theoretic Local Non-malleable Codes and Their Applications (Q2799102) (← links)
- On Locally Decodable Codes, Self-correctable Codes, and t-Private PIR (Q3603474) (← links)
- On the Power of Relaxed Local Decoding Algorithms (Q4989919) (← links)
- Some Open Problems in Information-Theoretic Cryptography (Q5136294) (← links)
- High-rate codes with sublinear-time decoding (Q5501932) (← 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)
- Explicit and nearly tight lower bound for 2-party perfectly secure FSS (Q6535135) (← links)
