Enumerative coding for line polar Grassmannians with applications to codes

DOI10.1016/J.FFA.2017.03.005zbMATH Open1375.14164arXiv1412.5466OpenAlexW2404884661MaRDI QIDQ2363322FDOQ2363322

Authors: Ilaria Cardinali, Luca Giuzzi 

Publication date: 13 July 2017

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: A $k$-polar Grassmannian is the geometry having as pointset the set of all $k$-dimensional subspaces of a vector space $V$ which are totally isotropic for a given non-degenerate bilinear form $mu$ defined on $V.$ Hence it can be regarded as a subgeometry of the ordinary $k$-Grassmannian. In this paper we deal with orthogonal line Grassmannians and with symplectic line Grassmannians, i.e. we assume $k=2$ and $mu$ a non-degenerate symmetric or alternating form. We will provide a method to efficiently enumerate the pointsets of both orthogonal and symplectic line Grassmannians. This has several nice applications; among them, we shall discuss an efficient encoding/decoding/error correction strategy for line polar Grassmann codes of both types.

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

Recommendations

• Codes on linear sections of the Grassmannian
• scientific article; zbMATH DE number 4041793
• Enumerative Coding for Grassmannian Space
• On the Grassmann graph of linear codes
• Counting polynomials for linear codes, hyperplane arrangements, and matroids
• scientific article; zbMATH DE number 1047011
• scientific article; zbMATH DE number 125912
• Linear programming bounds for codes in grassmannian spaces
• Line polar Grassmann codes of orthogonal type
• A Gröbner representation for linear codes

zbMATH Keywords

linear codessymplectic GrassmannianOrthogonal Grassmannian

Mathematics Subject Classification ID

Grassmannians, Schubert varieties, flag manifolds (14M15) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50)

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 weyl modules and the irreducible representations of the symplectic group with the fundamental highest weights
• Automorphism groups of Grassmann codes
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• Coding for Errors and Erasures in Random Network Coding
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Duals of Affine Grassmann Codes and Their Relatives
• The minimum weight of the Grassmann codes C(k,n)
• Enumerative source encoding
• Hyperplane sections of Grassmannians and the number of MDS linear codes
• Minimum distance of orthogonal line-Grassmann codes in even characteristic
• Minimum distance of symplectic Grassmann codes
• Grassmann and Weyl embeddings of orthogonal Grassmannians
• Enumerative Coding for Grassmannian Space
• Codes and caps from orthogonal Grassmannians
• Locally decodable codes: a brief survey
• On the efficiency of local decoding procedures for error-correcting codes
• Locally decodable codes and private information retrieval schemes.
• Title not available (Why is that?)
• Weight Spectrum of Codes Associated With the Grassmannian <formula formulatype="inline"><tex Notation="TeX">$G(3,7)$</tex></formula>
• Embeddings of line-Grassmannians of polar spaces in Grassmann varieties
• Line polar Grassmann codes of orthogonal type

Cited In (10)

• Line Hermitian Grassmann codes and their parameters
• Littlewood polynomials, spectral-null codes, and equipowerful partitions
• Implementing line-Hermitian Grassmann codes
• Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes
• Line polar Grassmann codes of orthogonal type
• Fast enumeration of Grassmannian elements
• Codes on linear sections of the Grassmannian
• Minimum distance of symplectic Grassmann codes
• The polynomial degree of the Grassmannian \(G(1,n,q)\) of lines in finite projective space \(PG(n,q)\)
• Minimum distance of orthogonal line-Grassmann codes in even characteristic

This page was built for publication: Enumerative coding for line polar Grassmannians with applications to codes

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