2023/02/16 by Kiermaier, Michael, Kurz, Sascha
#004 #510 #classification #divisible codes #linear codes
paper · doi:10.15495/epub_ubt_00006857
We classify all q-ary Δ-divisible linear codes which are spanned by codewords of weight Δ. The basic building blocks are the simplex codes, and for q=2 additionally the first order Reed-Muller codes and the parity check codes. This generalizes a result of Pless and Sloane, where the binary self-orthogonal codes spanned by codewords of weight 4 have been classified, which is the case q=2 and Δ=4 of our classification. As an application, we give an alternative proof of a theorem of Liu on binary Δ-divisible codes of length 4Δ in the projective case.