Lengths of divisible codes - the missing cases

Titelangaben

Kurz, Sascha:
Lengths of divisible codes - the missing cases.
Bayreuth , 2024 . - 12 S.
DOI: https://doi.org/10.15495/EPub_UBT_00007502

Volltext

Link zum Volltext (externe URL):

Abstract

A linear code C over GF(q) is called Δ-divisible if the Hamming weights wt(c) of all codewords c in C are divisible by Δ. The possible effective lengths of q^r-divisible codes have been completely characterized for each prime power q and each non-negative integer r. The study of Δ divisible codes was initiated by Harold Ward. If c divides Δ but is coprime to q, then each Δ-divisible code C over GF(q) is the c-fold repetition of a Δ/c-divisible code. Here we determine the possible effective lengths of p^r-divisible codes over finite fields of characteristic p, where r is an integer but p^r is not a power of the field size, i.e., the missing cases.