<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>04158556</id>
  <dt>j</dt>
  <an>04158556</an>
  <augroup>
    <au>Ryan, Charles T.</au>
    <au>Ryan, Kevin M.</au>
  </augroup>
  <ti>The minimum weight of the Grassmann codes C(k,n).</ti>
  <so>Discrete Appl. Math. 28, No.2, 149-156 (1990).</so>
  <py>1990</py>
  <pu>Elsevier Science B.V. (North-Holland), Amsterdam</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>linear block codes</ut>
    <ut>Grassmann variety</ut>
    <ut>Pl\"ucker coordinates</ut>
    <ut>minimum weight</ut>
    <ut>affine charts</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/0166-218X(90)90112-P</li>
  </ligroup>
  <abgroup>
    <ab>Summary: In this paper we continue the investigation of a family of linear block codes based on the geometry of the Grassmann variety G(k,n) of k-planes in the n-dimensional vector space over ${\bbfZ}\sb 2$. These codes, denoted by C(k,n), have as their generator matrix the $(\frac{n}{k})\times \vert G(k,n)\vert$ matrix whose columns are the Pl\"ucker coordinates of the points of G(k,n). The major results established herein are: The minimum weight of C(k,n) is equal to $2\sp{k(n-k)}$. The number of codewords in C(k,n) of minimal weight is equal to $\vert G(k,n)\vert$. The minimal weight codewords of C(k,n) are the affine charts of G(k,n).</ab>
    <rv></rv>
  </abgroup>
</item>