Divisible Codes

Titelangaben

Kurz, Sascha:
Divisible Codes.
Bayreuth , 2022 . - II, 102 S.
DOI: https://doi.org/10.15495/EPub_UBT_00007397

Volltext

Link zum Volltext (externe URL):

Abstract

A linear code over GF(q) with the Hamming metric is called Δ-divisible if the weights of all codewords are divisible by Δ. They have been introduced by Harold Ward a few decades ago. Applications include subspace codes, partial spreads, vector space partitions, and distance optimal codes. The determination of the possible lengths of projective divisible codes is an interesting and comprehensive challenge.