On triply even binary codes
From MaRDI portal
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.
Recommendations
- scientific article; zbMATH DE number 4102989
- Ternary codes from graphs on triples
- The Lengths of Projective Triply-Even Binary Codes
- scientific article; zbMATH DE number 3883635
- On three-element codes
- Binary codes from graphs on triples
- On the decoding of some exceptional ternary codes
- On the binary codes with parameters of triply-shortened 1-perfect codes
- scientific article; zbMATH DE number 2108129
- Ternary codes of steiner triple systems
Cited in
(10)- On three-element codes
- Residue codes of extremal type II \(\mathbb Z_4\)-codes and the moonshine vertex operator algebra
- A note on the Assmus-Mattson theorem for some binary codes
- On strongly walk regular graphs, triple sum sets and their codes
- Fault-tolerant conversion between adjacent Reed–Muller quantum codes based on gauge fixing
- On some projective triply-even binary codes invariant under the Conway group \(\mathrm{Co}_1\)
- The support designs of the triply even binary codes of length 48
- Ternary trades and their codes
- On the constructions of holomorphic vertex operator algebras of central charge 24
- Binary self-orthogonal codes which meet the Griesmer bound or have optimal minimum distances
This page was built for publication: On triply even binary codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2909039)