On triply even binary codes

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 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.

21 pages + appendix of 10 pages. Minor revision

References in corpus (1)

• Quadratic spaces and holomorphic framed vertex operator algebras of central charge 24

Cited by in corpus (20)

• Magic state distillation with low overhead
• Quadratic spaces and holomorphic framed vertex operator algebras of central charge 24
• Gauge color codes in two dimensions
• Computer classification of linear codes
• Projective divisible binary codes
• Doubled Color Codes
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• On strongly walk regular graphs, triple sum sets and their codes
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• The lengths of projective triply-even binary codes
• Resource optimization for fault-tolerant quantum computing
• Transversal Clifford and T-gate codes of short length and high distance
• Residue codes of extremal Type II Z_4-codes and the moonshine vertex operator algebra
• Classification of linear codes using canonical augmentation
• Classification of holomorphic framed vertex operator algebras of central charge 24
• On projective $q^r$-divisible codes
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes
• Construction of holomorphic local conformal framed nets
• The support designs of the triply even codes of length 48
• Classification of $\Delta$-divisible linear codes spanned by codewords of weight $\Delta$