Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8897369 | Journal of Pure and Applied Algebra | 2018 | 14 Pages |
Abstract
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for q even. The case q odd was solved in [3]. For nâ 3 we also determine their second smallest distance. Furthermore, we show that for q even all minimum weight codewords are equivalent and that the symplectic line-Grassmann codes are proper subcodes of codimension 2n of the orthogonal ones.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Ilaria Cardinali, Luca Giuzzi,