Higher weights of Grassmann codes in terms of properties of Schubert unions
Abstract
We describe the higher weights of the Grassmann codes G(2,m) over finite fields Fq in terms of properties of Schubert unions, and in each case we determine the weight as the minimum of two explicit polynomial expressions in q.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.