jump to navigation

Problem of the Day #243: Sets of Binary Strings November 17, 2011

Posted by Saketh in : potd , trackback

Alex wants to find a set of binary strings of length $n$ such that they all differ by at least $3$ bits. Find, in terms of $n$, the size of the largest set he can make.


no comments yet - be the first?