scientific article; zbMATH DE number 2019623
From MaRDI portal
Publication:4440426
Recommendations
- Lower bounds for linear locally decodable codes and private information retrieval
- Automata, Languages and Programming
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- A quadratic lower bound for three-query linear locally decodable codes over any field
Cited in
(17)- An optimal lower bound for 2-query locally decodable linear codes
- Query-efficient locally decodable codes of subexponential length
- General constructions for information-theoretic private information retrieval
- A quadratic lower bound for three-query linear locally decodable codes over any field
- A quadratic lower bound for three-query linear locally decodable codes over any field
- On the power of relaxed local decoding algorithms
- Lower bounds for 2-query LCCs over large alphabet
- Composition of Low-Error 2-Query PCPs Using Decodable PCPs
- High-rate codes with sublinear-time decoding
- Lower bounds for adaptive locally decodable codes
- Bounds on \(2\)-query codeword testing
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Towards lower bounds on locally testable codes via density arguments
- Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
- Relaxed locally correctable codes with improved parameters
- Lower bounds for linear locally decodable codes and private information retrieval
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440426)
