Matching Vector Codes
From MaRDI portal
Publication:3096097
DOI10.1137/100804322zbMath1228.68026OpenAlexW2177108502MaRDI QIDQ3096097
Parikshit Gopalan, Zeev Dvir, Sergey Yekhanin
Publication date: 7 November 2011
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/100804322
Other designs, configurations (05B30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Coding theorems (Shannon theory) (94A24)
Related Items (18)
Proof of the Kakeya set conjecture over rings of integers modulo square-free N ⋮ A quadratic lower bound for three-query linear locally decodable codes over any field ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Secure computation with preprocessing via function secret sharing ⋮ Erasures versus errors in local decoding and property testing ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Lower bounds for (batch) PIR with private preprocessing ⋮ Unnamed Item ⋮ A novel elementary construction of matching vectors ⋮ On matrix rigidity and locally self-correctable codes ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Locally Decodable Codes: A Brief Survey ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ High-rate codes with sublinear-time decoding ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations ⋮ Local correctability of expander codes
This page was built for publication: Matching Vector Codes
