A novel elementary construction of matching vectors

DOI10.1016/j.ipl.2012.03.008zbMath1243.94047OpenAlexW1999059597MaRDI 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

zbMATH Keywords

computational complexityerror-correcting codeslocally decodable codesmatching vectors

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Other types of codes (94B60) Coding theorems (Shannon theory) (94A24)

Related Items (1)

Proof of the Kakeya set conjecture over rings of integers modulo square-free N

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

This page was built for publication: A novel elementary construction of matching vectors