Paperlane

no. 13 · Wednesday 11 November 2026

Maximal Triply Even Binary Codes from Elliptic Orthogonal Graphs

Yusuke Kasai and Yuto Nogata

math.CO · 11 pp

Abstract

For a finite set $X$, a binary linear code $C\subseteq\mathbb{F}_2^X$ is called a triply even binary code if $\operatorname{wt}(c)\equiv 0\pmod{8}$ for every $c\in C$. Let $q$ be an odd prime power and $n$ be an integer with $n\ge 2$. Let $E^-_{2n+2}(q)$ denote the binary code spanned by all pairwise sums of rows of the adjacency matrix of the elliptic orthogonal graph arising from a $(2n+2)$-dimensional elliptic quadratic space over $\mathbb{F}_q$. We prove that $E^-_{2n+2}(q)$ is a triply even binary code if and only if $n=2$ and $q\equiv 3\pmod{4}$. In this case, we also prove that $E^-_6(q)$ is a maximal triply even binary code.

comments
11 pages
fields
Combinatorics
pdf ↗ page arXiv:2611.13586 ↗