An introduction to divisible codes
A linear code is called divisible if all codeword weights have a nontrivial common divisor. The author presents in this paper some basic facts about divisible codes, culminating in a ``divisible'' version of the Gleason-Pierce theorem on self-dual codes.
scientific article; zbMATH DE number 1392728