The question seems like it should be known. However, I was not able to find it anywhere. How many binary strings of length n are required. So that for every k positions in these strings all $2^k$ possible sequences occur? I am interested in precise upper and lower bounds. Bounds which are within a constant of each other (independent of n and k) suffice for my purposes.