For non-negative integer $d\le n$ and $k\le 2^n$, how many affine subspaces of co-dimension $d$ are needed to cover all, but exactly $k$ elements of the vector space ${\mathbb F}_2^n$, and what are the possible values of $k$?

I know the answer in two particular cases. For $d=1$ we consider hyperplane coverings. It is easy to see that in this case $k$ must be a power of $2$, and for all but $k=2^s$ elements to be covered, one needs at lease $n-s$ hyperplanes. 

Another situation where the answer is known to me is $k=1$: by a year 1977 result of R. Jamison, to cover all but exactly one element of ${\mathbb F}_2^n$, one needs at least $n+2^d-d-1$ affine co-$d$-subspaces.

What is the answer in the general case? Has it ever been studied?