On the Lengths of Divisible Codes
From MaRDI portal
Abstract: In this article, the effective lengths of all -divisible linear codes over with a non-negative integer are determined. For that purpose, the -adic expansion of an integer is introduced. It is shown that there exists a -divisible -linear code of effective length if and only if the leading coefficient of the -adic expansion of is non-negative. Furthermore, the maximum weight of a -divisible code of effective length is at most , where denotes the cross-sum of the -adic expansion of . 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.
Cited in
(20)- A family of self-orthogonal divisible codes with locality 2
- Affine vector space partitions
- Some two-weight codes invariant under the \(3\)-fold covers of the Mathieu groups \(\mathrm{M}_{22}\) and \(\Aut(\mathrm{M}_{22})\)
- Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
- Lengths of divisible codes: the missing cases
- Constant dimension codes from multilevel construction based on matchings of complete hypergraphs
- Divisibility of codes meeting the Griesmer bound
- Bounds for flag codes
- On the Codes Generated by Certain Divisible Designs
- Combining subspace codes
- A selection of divisible lexicographic codes
- Length Codes, Products of Languages and Primality
- The interplay of different metrics for the construction of constant dimension codes
- Divisible codes
- The augmented codes of a family of linear codes with locality 2
- Vector space partitions of GF(2)^8
- Multilevel inserting constructions for constant dimension subspace codes
- An introduction to divisible codes
- Subspace packings: constructions and bounds
- scientific article; zbMATH DE number 1767697 (Why is no real title available?)
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)