2019/12/20 by Daniel Heinlein, Thomas Honold, Heinlein, Daniel +7
Mathematics · #94B27 #94B65 #Combinatorics (math.CO) #FOS: Mathematics #Primary: 94B05 #Secondary: 05B40 #math.CO #msc:05B40 #msc:94B05 #msc:94B27 #msc:94B65
paper · pdf · doi:10.48550/arxiv.1912.10147
38 pages
arxiv created 2019/12/20 · arxiv updated 2019/12/24
A projective linear code over \mathbbFq is called Δ-divisible if all weights of its codewords are divisible by Δ. Especially, qr-divisible projective linear codes, where r is some integer, arise in many applications of collections of subspaces in \mathbbFqv. One example are upper bounds on the cardinality of partial spreads. Here we survey the known results on the possible lengths of projective qr-divisible linear codes.