New Bounds for the Minimum Length of Binary Linear Block Codes

Let $n(k,d)$ be the smallest integer $n$ for which a binary linear code of length $n$, dimension $k$ and minimum distance $d$ exists. We prove that $n(9,24)\geq 54, n(9,28)\geq62, n(9,30)\geq 66, n(9,56)\geq 117, n(10,44)\geq 95, n(10,60)\geq 125, n(13,56)\geq 122, n(14,48)\geq 107$ and review known results for $n(9,d)$.