1 Ocak 2021 Dergi makalesi Açık Erişim

Borello, Martino; Guneri, Cem; Sacikara, Elif; Sole, Patrick

MARC21 XML

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield>
    <subfield code="o">oai:aperta.ulakbim.gov.tr:236916</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">The decomposition of a quasi-abelian code into shorter linear codes over larger alphabets was given in Jitman and Ling (Des Codes Cryptogr 74:511-531, 2015), extending the analogous Chinese remainder decomposition of quasi-cyclic codes (Ling and Sole in IEEE Trans Inf Theory 47:2751-2760, 2001). We give a concatenated decomposition of quasi-abelian codes and show, as in the quasi-cyclic case, that the two decompositions are equivalent. The concatenated decomposition allows us to give a general minimum distance bound for quasi-abelian codes and to construct some optimal codes. Moreover, we show by examples that the minimum distance bound is sharp in some cases. In addition, examples of large strictly quasi-abelian codes of about a half rate are given. The concatenated structure also enables us to conclude that strictly quasi-abelian linear complementary dual codes over any finite field are asymptotically good.</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">article</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="a">Creative Commons Attribution</subfield>
    <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="a">Borello, Martino</subfield>
    <subfield code="u">Univ Paris 08, Univ Sorbonne Paris Nord, CNRS, UMR 7539,Lab Geometrie Analyse &amp; Applicat,LAGA, F-93430 Villetaneuse, France</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="z">md5:b25b4f269b3675a0e4f775e3370d37ee</subfield>
    <subfield code="s">139</subfield>
    <subfield code="u">https://aperta.ulakbim.gov.trrecord/236916/files/bib-9df979e1-5273-41f9-9fd2-efce73da6975.txt</subfield>
  </datafield>
  <controlfield tag="005">20221007094720.0</controlfield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2021-01-01</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.1007/s10623-021-00921-4</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">The concatenated structure of quasi-abelian codes</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="4">
    <subfield code="p">DESIGNS CODES AND CRYPTOGRAPHY</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Guneri, Cem</subfield>
    <subfield code="u">Sabanci Univ, Fac Engn &amp; Nat Sci, TR-34956 Istanbul, Turkey</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Sacikara, Elif</subfield>
    <subfield code="u">Univ Zurich, Inst Math, Zurich, Switzerland</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="a">Sole, Patrick</subfield>
    <subfield code="u">Aix Marseille Univ, CNRS, Ctr Marseille, I2M, Marseille, France</subfield>
  </datafield>
  <controlfield tag="001">236916</controlfield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
  </datafield>
</record>