<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">47580760X</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180406123751.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170329e20001001xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1023/A:1008356131869</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1023/A:1008356131869</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">New Linear Codes Over $$\mathbb{F}_3 $$ and $$\mathbb{F}_5 $$and Improvements on Bounds</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Irfan Siap, Dijen Ray-Chaudhuri]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">One of the most important problems of coding theory is to constructcodes with best possible minimum distances. In this paper, we generalize the method introduced by [8] and obtain new codes which improve the best known minimum distance bounds of some linear codes. We have found a new linear ternary code and 8 new linear codes over $$\mathbb{F}_5 $$ with improved minimumdistances. First we introduce a generalized version of Gray map,then we give definition of quasi cyclic codes and introduce nearlyquasi cyclic codes. Next, we give the parameters of new codeswith their generator matrices. Finally, we have included twotables which give Hamming weight enumerators of these new codes.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Kluwer Academic Publishers, 2000</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Quasi cyclic codes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">nearly quasi cyclic codes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">new codes</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">improved bounds</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Siap</subfield>
   <subfield code="D">Irfan</subfield>
   <subfield code="u">Department of Mathematics, The Ohio State University, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ray-Chaudhuri</subfield>
   <subfield code="D">Dijen</subfield>
   <subfield code="u">Department of Mathematics, The Ohio State University, USA</subfield>
   <subfield code="4">aut</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">21/1-3(2000-10-01), 223-233</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">21:1-3&lt;223</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">21</subfield>
   <subfield code="o">10623</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1023/A:1008356131869</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.1023/A:1008356131869</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Siap</subfield>
   <subfield code="D">Irfan</subfield>
   <subfield code="u">Department of Mathematics, The Ohio State University, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ray-Chaudhuri</subfield>
   <subfield code="D">Dijen</subfield>
   <subfield code="u">Department of Mathematics, The Ohio State University, USA</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">21/1-3(2000-10-01), 223-233</subfield>
   <subfield code="x">0925-1022</subfield>
   <subfield code="q">21:1-3&lt;223</subfield>
   <subfield code="1">2000</subfield>
   <subfield code="2">21</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="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>
