A New Lower Bound on the Minimal Length of a Binary Linear Code

In [4] Dodunekov and Manev have shown thatn(k, 2k-i) ≥g(k, 2k-i)+2for3≤i≤k-4.In casek≥9,we further improve this bound. The non-existence /existence of certain codes is established to prepare a table of bounds onn(9, d)ford≤28.