Minimum distance of symplectic Grassmann codes

DOI10.1016/J.LAA.2015.09.031zbMATH Open1330.51001arXiv1503.05456OpenAlexW2168615060MaRDI QIDQ896842FDOQ896842

Authors: Ilaria Cardinali, Luca Giuzzi 

Publication date: 14 December 2015

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: We introduce the Symplectic Grassmann codes as projective codes defined by symplectic Grassmannians, in analogy with the orthogonal Grassmann codes introduced in [4]. Note that the Lagrangian-Grassmannian codes are a special class of Symplectic Grassmann codes. We describe the weight enumerator of the Lagrangian--Grassmannian codes of rank $2$ and $3$ and we determine the minimum distance of the line Symplectic Grassmann codes.

Full work available at URL: https://arxiv.org/abs/1503.05456

Recommendations

• Minimum distance of orthogonal line-Grassmann codes in even characteristic
• On Lagrangian-Grassmannian codes
• The weight distribution of a family of Lagrangian-Grassmannian codes
• The structure of dual Grassmann codes
• Line Hermitian Grassmann codes and their parameters

zbMATH Keywords

dual polar spaceerror correcting codesymplectic GrassmannianLagrangian Grassmannian code

Mathematics Subject Classification ID

Polar geometry, symplectic spaces, orthogonal spaces (51A50) Linear codes (general theory) (94B05) Incidence structures embeddable into projective geometries (51A45) Linear codes and caps in Galois spaces (51E22)

Cites Work

• Title not available (Why is that?)
• Algebraic geometric codes. Basic notions
• Some subspaces of the \(k\)th exterior power of a symplectic vector space
• The universal embedding dimension of the binary symplectic dual polar space
• The weyl modules and the irreducible representations of the symplectic group with the fundamental highest weights
• Generalized Hamming weights for linear codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the universal embedding of the \(Sp_{2n}(2)\) dual polar space
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Geometric approach to higher weights
• On Lagrangian-Grassmannian codes
• The Hyperplanes ofDW(5, 2)
• The hyperplanes of \(DW(5,2^h)\)which arise from embedding
• Codes and caps from orthogonal Grassmannians
• Line polar Grassmann codes of orthogonal type
• The combinatorial properties of the hyperplanes of \(D\)W\((5,q)\) arising from embedding
• Enumerative coding for line polar Grassmannians with applications to codes
• Title not available (Why is that?)

Cited In (9)

• Infinite families of \((q^2+1)\)-tight sets of quadrics with an automorphism group \(\mathrm{PSp}(n, q), n=4, 6\)
• Line Hermitian Grassmann codes and their parameters
• Implementing line-Hermitian Grassmann codes
• The weight distribution of a family of Lagrangian-Grassmannian codes
• Line polar Grassmann codes of orthogonal type
• Intersections of the Hermitian surface with irreducible quadrics in even characteristic
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• Minimum distance of orthogonal line-Grassmann codes in even characteristic
• Enumerative coding for line polar Grassmannians with applications to codes

Uses Software

• Code Tables

This page was built for publication: Minimum distance of symplectic Grassmann codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896842)