On the maximum number of vectors in \0,1\n with forbidden inner products
Abstract
Let M ⊂ \0,1\n be a set such that (m,m)=4 for every m∈ M, and (m1,m2)∈\-4,-3,-2,-1,0,3\ for any two distinct vectors m1,m2∈ M. We determine the maximum possible cardinality of such a set M for all sufficiently large n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.