Minimum distance of symplectic Grassmann codes

DOI10.1016/J.LAA.2015.09.031MaRDI QIDQ896842zbMATH OpenOpenAlexFDO

Authors Ilaria Cardinali, Luca Giuzzi

Publication date 14 December 2015

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

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 4041793 (Why is no real title available?)
• scientific article; zbMATH DE number 4041794 (Why is no real title available?)
• scientific article; zbMATH DE number 52497 (Why is no real title available?)
• scientific article; zbMATH DE number 53569 (Why is no real title available?)
• scientific article; zbMATH DE number 1009714 (Why is no real title available?)
• scientific article; zbMATH DE number 1461536 (Why is no real title available?)
• scientific article; zbMATH DE number 749953 (Why is no real title available?)
• scientific article; zbMATH DE number 6260122 (Why is no real title available?)
• Algebraic geometric codes. Basic notions
• Codes and caps from orthogonal Grassmannians
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• Enumerative coding for line polar Grassmannians with applications to codes
• Generalized Hamming weights for linear codes
• Geometric approach to higher weights
• Line polar Grassmann codes of orthogonal type
• On Lagrangian-Grassmannian codes
• On the universal embedding of the \(Sp_{2n}(2)\) dual polar space
• Some subspaces of the \(k\)th exterior power of a symplectic vector space
• The Hyperplanes ofDW(5, 2)
• The combinatorial properties of the hyperplanes of \(D\)W\((5,q)\) arising from embedding
• The hyperplanes of \(DW(5,2^h)\)which arise from embedding
• 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

Cited in

(9)

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

Describes a project that uses

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)