An integer determinant approach to the length of Type II codes and the weights of shadows

Jae-Hyun Baek, Jon-Lark Kim

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…