<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">477041000</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180405111318.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170330e19960801xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF00169780</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF00169780</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Walker</subfield>
   <subfield code="D">Judy</subfield>
   <subfield code="u">Department of Mathematics, Universityof Illinois, 61801, Urbana, IL</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A new approach to the main conjecture on algebraic-geometric MDS Codes</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Judy Walker]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The Main Conjecture on MDS Codes states that for every linear [n, κ] MDS code over $$\mathbb{F}$$ q , if 1 &lt; κ &lt; q, then n ≤ q + 1, except when q is seven and κ = 3 or κ = q − 1, in which cases n ≤ q + 2. Recently, there has been an attempt to prove the conjecture in the case of algebraic-geometric codes. The method until now has been to reduce the conjecture to a statement about the arithmetic of the jacobian of the curve, and the conjecture has been successfully proven in this way for elliptic and hyperelliptic curves. We present a new approach to the problem, which depends on the geometry of the curve after an appropriate embedding. Using algebraic-geometric methods, we then prove the conjecture through this approach in the case of elliptic curves. In the process, we prove a new result about the maximum number of points in an arc which lies on an elliptic curve.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 1996</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Algebraic-geometric codes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">MDS codes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">elliptic curves</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Designs, Codes and Cryptography</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">9/1(1996-08-01), 115-120</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">9:1&lt;115</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">9</subfield>
   <subfield code="o">10623</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF00169780</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF00169780</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Walker</subfield>
   <subfield code="D">Judy</subfield>
   <subfield code="u">Department of Mathematics, Universityof Illinois, 61801, Urbana, IL</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Designs, Codes and Cryptography</subfield>
   <subfield code="d">Kluwer Academic Publishers</subfield>
   <subfield code="g">9/1(1996-08-01), 115-120</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">9:1&lt;115</subfield>
   <subfield code="1">1996</subfield>
   <subfield code="2">9</subfield>
   <subfield code="o">10623</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="986" ind1=" " ind2=" ">
   <subfield code="a">SWISSBIB</subfield>
   <subfield code="b">477040772</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
