The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
Let n(8, d) be the smallest integer a for which a binary Linear code of length n, dimension 8, and minimum distance d exists. We prove that n(8, 18) = 42, n(8, 26) = 58, n(8, 28) = 61, n(8, 30) = 65, a(8, 34) = 74, n(8, 36) 77, n(8, 38) = 81, n(8, 42) = 89, and n(8, 60) = 124. After these results, all values of n(8, d) are known.
binary linear code minimum distance bounds