Minimum distance and the minimum weight codewords of Schubert codes
From MaRDI portal
Publication:1679693
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 -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.
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
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 3530031 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (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?)
- Algebraic geometric codes. Basic notions
- Automorphism groups of Grassmann codes
- Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
- Duals of Affine Grassmann Codes and Their Relatives
- Grassmann codes and Schubert unions
- Minimum-weight codewords as generators of generalized Reed-Muller codes
- On the Minimum Distance Conjecture for Schubert Codes
- On the linear codes arising from Schubert varieties
- On the minimum distances of Schubert codes
- Schubert varieties, linear codes and enumerative combinatorics.
- The Structure of Dual Schubert Union Codes
- The minimum weight of the Grassmann codes C(k,n)
- The structure of dual Grassmann codes
Cited in
(13)- Schubert unions in Grassmann varieties
- Subclose Families, Threshold Graphs, and the Weight Hierarchy of Grassmann and Schubert Codes
- Hyperplane sections of determinantal varieties over finite fields and linear codes
- scientific article; zbMATH DE number 7528063 (Why is no real title available?)
- Decomposable subspaces, linear sections of Grassmann varieties, and higher weights of Grassmann codes
- Schubert varieties, linear codes and enumerative combinatorics.
- On the linear codes arising from Schubert varieties
- The weight spectrum of certain affine Grassmann codes
- On the Minimum Distance Conjecture for Schubert Codes
- On the minimum distances of Schubert codes
- A note on the weight spectrum of the Schubert code \(C_{\alpha }(2, m)\)
- Linear codes associated to skew-symmetric determinantal varieties
- Hyperplane sections of Grassmannians and the number of MDS linear 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)