Automorphism groups of Grassmann codes

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We determine the automorphism group of three families of linear codes associated with the Grassmann variety $G(\ell,m)$ of $\ell$ dimensional subspaces of $\bF_q^m$: The Grassmann codes $C(\ell,m)$, the Affine Grassmann codes $C^A(l,m)$, and the Schubert divisor codes $C_{\Omega}(\ell,m)$. The code $C(\ell,m)$ corresponds to the projective system defined by the Pl\"{u}cker embedding $G(\ell,m) \subset \bP^{\binom{m}{\ell}-1}$. The code $C^A(\ell,m)$ is obtained by puncturing $C(\ell,m)$ on the points of a codimension one Schubert variety $\Omega$ of $G(\ell,m)$, and the code $C_{\Omega}(\ell,m)$ is obtained by puncturing $C(\ell,m)$ on the complement of $\Omega$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Automorphism groups of Grassmann codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Automorphism groups of Grassmann codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automorphism groups of Grassmann codes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-137354

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.