2023/03/30 by Theresa Körner, Körner, Theresa, Sascha Kurz +1
Computer Science · Mathematics · #05B40 #51E23 #Coding theory and cryptography #Combinatorics (math.CO) #Cooperative Communication and Network Coding #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2303.17172
openalex publication_date 2023/03/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We determine the minimum possible column multiplicity of even, doubly-, and triply-even codes given their length. This refines a classification result for the possible lengths of qr-divisible codes over \mathbbFq. We also give a few computational results for field sizes q>2. Non-existence results of divisible codes with restricted column multiplicities for a given length have applications e.g. in Galois geometry and can be used for upper bounds on the maximum cardinality of subspace codes.