scientific article; zbMATH DE number 7375835
From MaRDI portal
DOI10.4230/LIPIcs.APPROX-RANDOM.2017.30zbMath1467.68050arXiv1611.06980MaRDI QIDQ5002633
Avishay Tal, Sivakanth Gopi, Arnab Bhattacharyya
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1611.06980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Privacy of data (68P27)
Related Items
Spanoids---An Abstraction of Spanning Structures, and a Barrier for LCCs, Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propagation connectivity of random hypergraphs
- Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin.
- Probability in Banach spaces. Isoperimetry and processes
- Lower bounds for linear locally decodable codes and private information retrieval
- Central limit theorems for empirical measures
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
- 2-Server PIR with Sub-Polynomial Communication
- Private information retrieval
- On the efficiency of local decoding procedures for error-correcting codes
- Designing programs that check their work
- Blackbox Polynomial Identity Testing for Depth 3 Circuits
- Breaking the quadratic barrier for 3-LCC's over the reals
- Lower bounds for constant query affine-invariant LCCs and LTCs
- Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Exponential lower bound for 2-query locally decodable codes via a quantum argument
- Testing subgraphs in directed graphs
