Problem

Source: Iranian third round midterm Combinatorics exam problem 2

Tags: combinatorics



Let $n,k$ be positive integers so that $n \ge k$.Find the maximum number of binary sequances of length $n$ so that fixing any arbitary $k$ bits they do not produce all binary sequances of length $k$.For exmple if $k=1$ we can only have one sequance otherwise they will differ in at least one bit which means that bit produces all binary sequances of length $1$.