Question 32
A binary string of length $n$ is a sequence of $n$ digits, each of which is $0$ or $1$. The distance between two binary strings of the same length is the number of positions in which they disagree; for example, the distance between the strings $01101011$ and $00101110$ is $3$ since they differ in the second, sixth, and eighth positions.
Find as many binary strings of length $8$ as you can, such that the distance between any two of them is at least $3$. You get one point per string.
Find as many binary strings of length $8$ as you can, such that the distance between any two of them is at least $3$. You get one point per string.