On projective q^r-divisible codes

Publication date 20 December 2019

Abstract: A projective linear code over

m a t h b b F_{q}

is called

D e l t a

-divisible if all weights of its codewords are divisible by

D e l t a

. Especially,

q^{r}

-divisible projective linear codes, where

r

is some integer, arise in many applications of collections of subspaces in

m a t h b b F_{q}^{v}

. One example are upper bounds on the cardinality of partial spreads. Here we survey the known results on the possible lengths of projective

q^{r}

-divisible linear codes.

This page was built for publication: On projective $q^r$-divisible codes