Let n(8,d) be the smallest integer n 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, n(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.

If C is a binary linear code, one may choose a subset S of C, and form a new code C/sub S//sup T/ which is the row space of the matrix having the elements of S as its columns. One way of picking S is to choose a subgroup H of Aut(C) and let S be some H-stable subset of C. Using (primarily) this method for picking S, we obtain codes with record-breaking parameters [92,8,44], [105,8,50], [108,8,52], [79,9,36], [123,9,58], [130,9,62], [175,9,84], [242,9,118], and [245,9,120].