A conjecture on the minimum length of binary linear codes

We give a new conjecture on D_{2,k}, where D_{q,k} denotes the largest d such that a linear code of dimension k with minimum weight d meeting the Griesmer bound does not exist. We also prove that D_{2,11} = 1632, which yields that our conjecture is valid for dimensions k <= 11.