Minimum distance of Line Orthogonal Grassmann Codes in even characteristic
arXiv:1605.09333 · doi:10.1016/j.jpaa.2017.11.009
Abstract
In this paper we determine the minimum distance of orthogonal line-Grassmann codes for even. The case odd was solved in "I. Cardinali, L. Giuzzi, K. Kaipa, A. Pasini, Line Polar Grassmann Codes of Orthogonal Type, J. Pure Applied Algebra." We also show that for even all minimum weight codewords are equivalent and that symplectic line-Grassmann codes are proper subcodes of codimension of the orthogonal ones.
15 pages/revised version after review