### Abstract

A triply even code is a binary linear code in which the weight of every codeword is divisible by 8. We show how two doubly even codes of lengths m1 and m2 can be combined to make a triply even code of length m1+m2, and then prove that every maximal triply even code of length 48 can be obtained by combining two doubly even codes of length 24 in a certain way. Using this result, we show that there are exactly ten maximal triply even codes of length 48 up to equivalence.

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

Pages (from-to) | 1-16 |

Number of pages | 16 |

Journal | Journal of the London Mathematical Society |

Volume | 86 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2012 Aug |

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'On triply even binary codes'. Together they form a unique fingerprint.

## Cite this

Betsumiya, K., & Munemasa, A. (2012). On triply even binary codes.

*Journal of the London Mathematical Society*,*86*(1), 1-16. https://doi.org/10.1112/jlms/jdr054