# Matching-vector families and LDCs over large modulo

## Author(s): Dvir, Zeev; Hu, G

To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1hc1g
DC FieldValueLanguage
dc.contributor.authorDvir, Zeev-
dc.contributor.authorHu, G-
dc.date.accessioned2021-10-08T19:44:07Z-
dc.date.available2021-10-08T19:44:07Z-
dc.date.issued2013en_US
dc.identifier.citationDvir, Z, Hu, G. (2013). Matching-vector families and LDCs over large modulo. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8096 LNCS (513 - 526. doi:10.1007/978-3-642-40328-6_36en_US
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1hc1g-
dc.description.abstractWe prove new upper bounds on the size of families of vectors in ℤm n with restricted modular inner products, when m is a large integer. More formally, if ui,...,ut ∈ ℤm n and v1,...,vt ∈ ℤm n satisfy 〈ui, vi〉 ≡ 0 (mod m) and 〈ui, vj〉 ≢ 0 (mod m) for all i ≠ j ∈ [t], we prove that t ≤ O(mn/2+8.47). This improves a recent bound of t ≤ mn/2+O(log(m)) by [BDL13] and is the best possible up to the constant 8.47 when m is sufficiently larger than n. The maximal size of such families, called 'Matching-Vector families', shows up in recent constructions of locally decodable error correcting codes (LDCs) and determines the rate of the code. Using our result we are able to show that these codes, called Matching-Vector codes, must have encoding length at least K19/18 for K-bit messages, regardless of their query complexity. This improves a known super linear bound of K2Ω(√log K) proved in [BDL13]en_US
dc.format.extent513 - 526en_US
dc.language.isoen_USen_US
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en_US
dc.rightsAuthor's manuscripten_US
dc.titleMatching-vector families and LDCs over large moduloen_US
dc.typeConference Articleen_US
dc.identifier.doidoi:10.1007/978-3-642-40328-6_36-
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat
Matching-vector families and LDCs over large modulo.pdf165.18 kBAdobe PDF