In this paper we determine the minimum distance of orthogonal line-Grassmann codes for q even. The case q odd was solved in . For 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.
|Titolo:||Minimum distance of orthogonal line-Grassmann codes in even characteristic|
|Appare nelle tipologie:||1.1 Articolo in rivista|