Integer determinant reveals key length rules for binary Type II codes
An integer determinant approach to the length of Type II codes and the weights of shadows
Information Theory
Summary
Certain special binary codes called Type II codes only come in lengths divisible by 8, but the usual proof for this is complicated. The authors provide a new, simpler proof using integer determinants and properties of binary orthogonal matrices. Their approach also explains patterns in related structures called shadows of these codes and connects these findings to a mathematical concept called the Arf invariant. This work avoids advanced tools from invariant theory, making the results more accessible.
What this means in practice
- •For error correcting code engineers: Use simplified integer determinant tests to verify length constraints of Type II codes during code design.
- •For cryptography developers: Incorporate refined structural checks on self-dual codes to better understand code shadows relevant to secure communications.
A theory result. No direct application yet.
Authors
Jae-Hyun Baek, Jon-Lark Kim
Abstract
It is well known that the length $n$ of a binary Type II code is divisible by $8$. The classical proof relies on Gleason's theorem on weight enumerators. Motivated by a question of Vera Pless, we give elementary proofs of this fact that avoid invariant theory. Our main tool is a congruence modulo $8$ for the determinant of the integer Gram matrix $AA^{\mathsf T}$ of a binary orthogonal matrix $A$, obtained directly from the Leibniz expansion. It gives a short proof of a theorem of Janusz: the number of rows of weight congruent to $3 \pmod 4$ in a binary orthogonal matrix is divisible by $4$. From this single statement we derive both the length restriction for Type II codes and the theorem of Conway and Sloane that every vector in the shadow of a binary self-dual code of length $n$ has weight congruent to $n/2 \pmod 4$. We also give two short character-theoretic proofs of the length restriction and explain how all of these arguments detect the Arf invariant of a quadratic form.