New binary linear codes which are dual transforms of good codes
If C is a binary linear code, one may choose a subset S of C, and form a new code C-S(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].
binary linear code dual transform bounds