<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="5.3.1" xmlns="http://www.crossref.org/schema/5.3.1" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xsi:schemaLocation="http://www.crossref.org/schema/5.3.1 http://www.crossref.org/schema/deposit/crossref5.3.1.xsd">
 <head>
  <doi_batch_id>aspg-40-2821-1792533298</doi_batch_id>
  <timestamp>20261020215458</timestamp>
  <depositor>
   <depositor_name>American Scientific Publishing Group</depositor_name>
   <email_address>admin@americaspg.com</email_address>
  </depositor>
  <registrant>American Scientific Publishing Group</registrant>
 </head>
 <body>
  <journal>
   <journal_metadata language="en">
    <full_title>Pure Mathematics for Theoretical Computer Science</full_title>
    <abbrev_title>PMTCS</abbrev_title>
    <issn media_type="electronic">2995-3162</issn>
   </journal_metadata>
   <journal_issue>
    <publication_date media_type="online">
     <year>2023</year>
    </publication_date>
    <journal_volume>
     <volume>3</volume>
    </journal_volume>
    <issue>2</issue>
   </journal_issue>
   <journal_article publication_type="full_text">
    <titles>
     <title>Linear Codes over Finite Fields Based On Greedy Algorithms and Their Applications</title>
    </titles>
    <contributors>
     <person_name sequence="first" contributor_role="author">
      <given_name>Rama Asad</given_name>
      <surname>Nadweh</surname>
      <affiliations>
       <institution>
        <institution_name>Online Islamic University, Department Of Science and Information Technology, Doha, Qatar</institution_name>
       </institution>
      </affiliations>
     </person_name>
    </contributors>
    <jats:abstract>
     <jats:p>In this paper we prove that for any ordered basis of a vector space there is a basis for which the greedy code generated using the B-ordering is linear with respect to , where B2 is derived from by a lower triangular matrix P; . In Addition we prove a similar result for self-orthogonal greedy codes.</jats:p>
    </jats:abstract>
    <publication_date media_type="online">
     <year>2023</year>
    </publication_date>
    <pages>
     <first_page>25</first_page>
     <last_page>39</last_page>
    </pages>
    <publisher_item>
     <item_number item_number_type="article-number">2821</item_number>
    </publisher_item>
    <ai:program name="AccessIndicators">
     <ai:license_ref applies_to="vor">https://creativecommons.org/licenses/by/4.0/</ai:license_ref>
    </ai:program>
    <doi_data>
     <doi>10.54216/PMTCS.030202</doi>
     <resource>https://americaspg.com/journal/40/article/2821</resource>
     <collection property="text-mining">
      <item>
       <resource mime_type="application/pdf">https://americaspg.com/storage/51716552861.pdf</resource>
      </item>
     </collection>
    </doi_data>
   </journal_article>
  </journal>
 </body>
</doi_batch>
