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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
