On the Lengths of Divisible Codes

From MaRDI portal




Abstract: In this article, the effective lengths of all qr-divisible linear codes over mathbbFq with a non-negative integer r are determined. For that purpose, the Sq(r)-adic expansion of an integer n is introduced. It is shown that there exists a qr-divisible mathbbFq-linear code of effective length n if and only if the leading coefficient of the Sq(r)-adic expansion of n is non-negative. Furthermore, the maximum weight of a qr-divisible code of effective length n is at most sigmaqr, where sigma denotes the cross-sum of the Sq(r)-adic expansion of n. This result has applications in Galois geometries. A recent theorem of N{u{a}}stase and Sissokho on the maximum size of a partial spread follows as a corollary. Furthermore, we get an improvement of the Johnson bound for constant dimension subspace codes.












This page was built for publication: On the Lengths of Divisible Codes

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