All Questions
1 question
2
votes
1
answer
112
views
Find the largest subset of all binary arrays of length $n$ with $r$ ones which have pairwise distance greater than $m$
Let $\Omega = \left\lbrace x : |x| = r \, \text{for} \, x \in \mathbb{Z}_2^n \right\rbrace$ for $r \in \mathbb{N}$. We want to find the the biggest subset of $\Omega$, $\Gamma = \left\lbrace x \in \...
- 63.9k