Lengths of divisible codes with restricted column multiplicities

DOI10.3934/AMC.2023050MaRDI QIDQ6431381zbMATH OpenOpenAlexFDO

Authors Theresa Körnerm, Sascha Kurz

Publication date 30 March 2023

Full work available at URL https://doi.org/10.3934/amc.2023050

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Spreads and packing problems in finite geometry (51E23) Linear codes (general theory) (94B05) Other types of codes (94B60)

Abstract: 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 $q^r$-divisible codes over $mathbb{F}_q$. 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.

Recommendations

• scientific article; zbMATH DE number 1767697
• Divisible codes
• Binary divisible codes of maximum dimension
• The divisible code bound revisited
• A bound for divisible codes

Cited in

(2)

• Lengths of divisible codes: the missing cases
• A conjecture on the minimum length of linear codes over finite fields

This page was built for publication: Lengths of divisible codes with restricted column multiplicities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6431381)