New Lower Bounds for Matching Vector Codes

Abhishek Bhowmick, Zeev Dvir, Shachar Lovett

A Matching Vector (MV) family modulo $m$ is a pair of ordered lists $U=(u_1,...,u_t)$ and $V=(v_1,...,v_t)$ where $u_i,v_j\in {\mathbb{Z}}_m^n$ with the following inner product patt…