arXiv Analytics

Sign in

arXiv:1012.4134 [math.CO]AbstractReferencesReviewsResources

On triply even binary codes

Koichi Betsumiya, Akihiro Munemasa

Published 2010-12-19, updated 2011-08-03Version 3

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 m_1 and m_2 can be combined to make a triply even code of length m_1+m_2, 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 10 maximal triply even codes of length 48 up to equivalence.

Comments: 21 pages + appendix of 10 pages. Minor revision
Journal: J. London Math. Soc. (2) 86 (2012) 1-16
Categories: math.CO
Subjects: 05E20, 05E30, 94B05
Related articles: Most relevant | Search more
arXiv:math/0509164 [math.CO] (Published 2005-09-08)
Groebner bases and combinatorics for binary codes
arXiv:1011.3381 [math.CO] (Published 2010-11-15)
Equivalence between Extendibility and Factor-Criticality
arXiv:1001.5077 [math.CO] (Published 2010-01-28, updated 2011-04-02)
Proofs of Two Conjectures On the Dimensions of Binary Codes

Links

Toolbox