New Bounds for Matching Vector Families

DOI10.1137/130932296zbMath1314.05204OpenAlexW2011033415MaRDI QIDQ5173250

Abhishek Bhowmick, Zeev Dvir, Shachar Lovett

Publication date: 9 February 2015

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130932296

zbMATH Keywords

locally decodable codesmatching vector familiesrestricted modular intersections

Mathematics Subject Classification ID

General topics of discrete mathematics in relation to computer science (68R01) Combinatorics in computer science (68R05) Extremal set theory (05D05)

Related Items (5)

From Affine to Two-Source Extractors via Approximate Duality ⋮ Towards breaking the exponential barrier for general secret sharing ⋮ Secure computation with preprocessing via function secret sharing ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations

This page was built for publication: New Bounds for Matching Vector Families