### Abstract

If C is a binary linear code, one may choose a subset S of C, and form a new code CST 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].

Original language | English |
---|---|

Pages (from-to) | 2136-2137 |

Journal | IEEE Transactions on Information Theory |

Volume | 45 |

Issue number | 6 |

DOIs | |

Publication status | Published - 1999 |

## Cite this

Jaffe, D. B., & Simonis, J. (1999). New binary linear codes which are dual transforms of good codes.

*IEEE Transactions on Information Theory*,*45*(6), 2136-2137. https://doi.org/10.1109/18.782159