Skip to main content

All Questions

Filter by
Sorted by
Tagged with
5 votes
2 answers
496 views

Maximum number of vectors with upper bound on pairwise inner products

I have a collection $\{v_1,...,v_k\}$ of vectors in $\{\pm 1\}^n$ with the property that for all $i\neq j$ we have $\langle v_i, v_j \rangle \le c\log_2(n)$. I am looking for an upper bound on $k$ in ...
DPL's user avatar
  • 63