A novel elementary construction of matching vectors
From MaRDI portal
Publication:436582
DOI10.1016/j.ipl.2012.03.008zbMath1243.94047MaRDI QIDQ436582
Haibin Kan, Qian Guo, Chen Yuan
Publication date: 25 July 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.03.008
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
94B60: Other types of codes
94A24: Coding theorems (Shannon theory)
Cites Work
- Unnamed Item
- Locally decodable codes and private information retrieval schemes.
- Efficient checking of polynomials and proofs and the hardness of approximation problems
- Nearly-linear size holographic proofs
- Locally Decodable Codes: A Brief Survey
- Matching Vector Codes
- On the efficiency of local decoding procedures for error-correcting codes
- A Geometric Approach to Information-Theoretic Private Information Retrieval
- Towards 3-query locally decodable codes of subexponential length
- Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
- 3-query locally decodable codes of subexponential length
- Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
- Locally Decodable Codes
- Introduction to Coding Theory
