On the lengths of divisible codes
arXiv:1707.00650 · doi:10.1109/TIT.2020.2968832
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{ă}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.
arXiv comment17 pages, typos corrected; the paper was originally named "An improvement of the Johnson bound for subspace codes"
References in corpus (6)
- Optimal Binary Subspace Codes of Length 6, Constant Dimension 3 and Minimum Distance 4
- Improved upper bounds for partial spreads
- Asymptotic bounds for the sizes of constant dimension codes and an improved lower bound
- Bounds for projective codes from semidefinite programming
- Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
- The lengths of projective triply-even binary codes