Dergi makalesi Açık Erişim
Dougherty, Steven T.; Korban, Adrian; Sahinkaya, Serap; Ustun, Deniz
<?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:273382</subfield>
</datafield>
<datafield tag="520" ind1=" " ind2=" ">
<subfield code="a"><p>In this work, we present a new construction method for reversible codes. We employ composite matrices derived from group rings and show how to construct these matrices so that they are also reversible. Also in this work, we give an algorithm for calculating conflict free DNA codes that satisfy the Hamming distance, the reverse, the reverse-complement, the GC-content constraints with each DNA codeword being free from reverse complement sub-strings. By employing our construction method for reversible codes and our algorithm, we construct a number of DNA codes that satisfy the above constraints. Many of the codes we obtain have better parameters than some known DNA codes and many have parameters that are new to the literature.</p></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">Dougherty, Steven T.</subfield>
<subfield code="u">Univ Scranton, Dept Math, Scranton, PA 18518 USA</subfield>
</datafield>
<datafield tag="856" ind1="4" ind2=" ">
<subfield code="z">md5:c451a157c472b358f6847843de219d89</subfield>
<subfield code="s">213</subfield>
<subfield code="u">https://aperta.ulakbim.gov.trrecord/273382/files/bib-ab86e65f-61fa-4ecd-a991-3460f26c35ac.txt</subfield>
</datafield>
<controlfield tag="005">20240608065631.0</controlfield>
<datafield tag="260" ind1=" " ind2=" ">
<subfield code="c">2023-01-01</subfield>
</datafield>
<datafield tag="024" ind1=" " ind2=" ">
<subfield code="a">10.1109/TIT.2022.3217518</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">Construction of DNA Codes From Composite Matrices and a Bio-Inspired Optimization Algorithm</subfield>
</datafield>
<datafield tag="909" ind1="C" ind2="4">
<subfield code="v">69</subfield>
<subfield code="p">IEEE TRANSACTIONS ON INFORMATION THEORY</subfield>
<subfield code="c">16</subfield>
<subfield code="n">3</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">Korban, Adrian</subfield>
<subfield code="u">Univ Chester, Dept Phys Math & Engn Sci, Chester CH1 4AR, England</subfield>
</datafield>
<datafield tag="700" ind1=" " ind2=" ">
<subfield code="a">Sahinkaya, Serap</subfield>
<subfield code="u">Tarsus Univ, Fac Engn, Dept Nat & Math Sci, TR-33400 Mersin, Turkiye</subfield>
</datafield>
<datafield tag="700" ind1=" " ind2=" ">
<subfield code="a">Ustun, Deniz</subfield>
<subfield code="u">Tarsus Univ, Fac Engn, Dept Comp Engn, TR-33400 Mersin, Turkiye</subfield>
</datafield>
<controlfield tag="001">273382</controlfield>
<datafield tag="980" ind1=" " ind2=" ">
<subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield>
</datafield>
</record>
| Görüntülenme | 25 |
| İndirme | 4 |
| Veri hacmi | 852 Bytes |
| Tekil görüntülenme | 20 |
| Tekil indirme | 4 |