Let $S$ be a set of strings over $0,1$ such that if $x$ is in $S$
$x$ has $\le k-1\quad$ $0$'s
$x$ has $\le k-1\quad$ $1$'s
What is the MAX that $\sum_{x\in S} |x|$ can be?
Let $S$ be a set of strings over $0,1$ such that if $x$ is in $S$
$x$ has $\le k-1\quad$ $0$'s
$x$ has $\le k-1\quad$ $1$'s
What is the MAX that $\sum_{x\in S} |x|$ can be?