Minimum distance and the minimum weight codewords of Schubert codes

DOI10.1016/J.FFA.2017.08.014zbMATH Open1375.94169arXiv1609.08265OpenAlexW2526627974MaRDI QIDQ1679693FDOQ1679693

Authors: Sudhir R. Ghorpade, Prasant Singh 

Publication date: 21 November 2017

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

Abstract: We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by Xiang. We give an alternative proof of this formula. Further, we propose a characterization of the minimum weight codewords of Schubert codes by introducing the notion of Schubert decomposable elements of certain exterior powers. It is shown that codewords corresponding to Schubert decomposable elements are of minimum weight and also that the converse is true in many cases. A lower bound, and in some cases, an exact formula, for the number of minimum weight codewords of Schubert codes is also given. From a geometric point of view, these results correspond to determining the maximum number of $mathbb{F}_q$-rational points that can lie on a hyperplane section of a Schubert variety in a Grassmannian with its nondegenerate embedding in a projective subspace of the Pl"ucker projective space, and also the number of hyperplanes for which the maximum is attained.

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

Recommendations

• On the minimum distances of Schubert codes
• On the Minimum Distance Conjecture for Schubert Codes
• On the minimum distance of combinatorial codes
• Minimum distance bounds for \(s\)-regular codes
• Minimum distance of elliptic codes
• On the weight distribution of some minimal codes
• On the minimal distance of a polynomial code
• Minimum distance of relative Reed-Muller codes
• scientific article; zbMATH DE number 1932292
• On the minimum distance of cyclic codes

zbMATH Keywords

Schubert varietyGrassmannianminimum weight codewordsGrassmann codeminimum distance of a codeSchubert code

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) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Algebraic geometric codes. Basic notions
• Title not available (Why is that?)
• Automorphism groups of Grassmann codes
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• The structure of dual Grassmann codes
• Grassmann codes and Schubert unions
• Title not available (Why is that?)
• 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)
• On the Minimum Distance Conjecture for Schubert Codes
• On the minimum distances of Schubert codes
• On the linear codes arising from Schubert varieties
• Schubert varieties, linear codes and enumerative combinatorics.
• Title not available (Why is that?)
• Minimum-weight codewords as generators of generalized Reed-Muller codes
• The Structure of Dual Schubert Union Codes

Cited In (13)

• Schubert unions in Grassmann varieties
• Linear codes associated to skew-symmetric determinantal varieties
• A note on the weight spectrum of the Schubert code \(C_{\alpha }(2, m)\)
• On the Minimum Distance Conjecture for Schubert Codes
• Title not available (Why is that?)
• On the minimum distances of Schubert codes
• Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
• On the linear codes arising from Schubert varieties
• Schubert varieties, linear codes and enumerative combinatorics.
• Hyperplane sections of determinantal varieties over finite fields and linear codes
• Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
• Hyperplane sections of Grassmannians and the number of MDS linear codes
• The weight spectrum of certain affine Grassmann codes

This page was built for publication: Minimum distance and the minimum weight codewords of Schubert codes

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