2000 character limit reached
Higher weights of Grassmann codes in terms of properties of Schubert unions (1105.0087v1)
Published 30 Apr 2011 in math.AG, cs.IT, math.CO, and math.IT
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$.