2000 character limit reached
Higher weights of Grassmann codes in terms of properties of Schubert unions
Published 30 Apr 2011 in math.AG, cs.IT, math.CO, and math.IT | (1105.0087v1)
Abstract: We describe the higher weights of the Grassmann codes $G(2,m)$ over finite fields ${\mathbb F}_q$ 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$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.