A novel elementary construction of matching vectors

Authors:
Chen Yuan;Qian Guo;Haibin Kan
Affiliations:
Shanghai Key Lab of Intelligent Information Processing, School Of Computer Science, Fudan University, China;Shanghai Key Lab of Intelligent Information Processing, School Of Computer Science, Fudan University, China;Shanghai Key Lab of Intelligent Information Processing, School Of Computer Science, Fudan University, China
Venue:
Information Processing Letters
Year:
2012

Citing 15
Cited 1

Efficient checking of polynomials and proofs and the hardness of approximation problems

Efficient checking of polynomials and proofs and the hardness of approximation problems
Nearly-linear size holographic proofs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
On the efficiency of local decoding procedures for error-correcting codes

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A Geometric Approach to Information-Theoretic Private Information Retrieval

CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
Introduction to Coding Theory

Introduction to Coding Theory
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits

SIAM Journal on Computing
Towards 3-query locally decodable codes of subexponential length

Journal of the ACM (JACM)
3-query locally decodable codes of subexponential length

Proceedings of the forty-first annual ACM symposium on Theory of computing
Private information retrieval

Communications of the ACM
Matching Vector Codes

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Local List Decoding with a Constant Number of Queries

FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Locally decodable codes: a brief survey

IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Matching Vector Codes

SIAM Journal on Computing
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy

IEEE Transactions on Information Theory

New bounds for matching vector families

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

Z. Dvir, P. Gopalan, and S. Yekhanin (2010, 2011) [2,3] proposed an elementary construction of bounded family of matching vectors with size k=1m^'+1(m^'n-1)^(^n^-^1^)^/^2 for m^'=n and (n-1m^') for m^'=n and (nm^') for m^'