<?xml version="1.0" encoding="utf-8"?>
<journal>
<title>Iranian Journal of Mathematical Sciences and Informatics</title>
<title_fa>مجله علوم ریاضی و انفورماتیک</title_fa>
<short_title>IJMSI</short_title>
<subject>Basic Sciences</subject>
<web_url>http://ijmsi.ir</web_url>
<journal_hbi_system_id>1</journal_hbi_system_id>
<journal_hbi_system_user>admin</journal_hbi_system_user>
<journal_id_issn>1735-4463</journal_id_issn>
<journal_id_issn_online>2008-9473</journal_id_issn_online>
<journal_id_pii>8</journal_id_pii>
<journal_id_doi>10.61882/ijmsi</journal_id_doi>
<journal_id_iranmedex></journal_id_iranmedex>
<journal_id_magiran></journal_id_magiran>
<journal_id_sid>14</journal_id_sid>
<journal_id_nlai>8888</journal_id_nlai>
<journal_id_science>13</journal_id_science>
<language>en</language>
<pubdate>
	<type>jalali</type>
	<year>1398</year>
	<month>1</month>
	<day>1</day>
</pubdate>
<pubdate>
	<type>gregorian</type>
	<year>2019</year>
	<month>4</month>
	<day>1</day>
</pubdate>
<volume>14</volume>
<number>1</number>
<publish_type>online</publish_type>
<publish_edition>1</publish_edition>
<article_type>fulltext</article_type>
<articleset>
	<article>


	<language>en</language>
	<article_id_doi></article_id_doi>
	<title_fa></title_fa>
	<title>Computation of Minimum Hamming Weight for Linear Codes</title>
	<subject_fa>تخصصي</subject_fa>
	<subject>Special</subject>
	<content_type_fa>پژوهشي</content_type_fa>
	<content_type>Research paper</content_type>
	<abstract_fa></abstract_fa>
	<abstract>&lt;p&gt;In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$&amp;nbsp;&amp;nbsp;which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that under certain conditions a linear code takes the maximum of minimum Hamming weight.&lt;/p&gt;</abstract>
	<keyword_fa></keyword_fa>
	<keyword>Algebraic coding theory, Linear codes, Quasi-Frobenius rings,  Grobner basis, SPAP-rings.</keyword>
	<start_page>81</start_page>
	<end_page>93</end_page>
	<web_url>http://ijmsi.ir/browse.php?a_code=A-10-1272-3&amp;slc_lang=en&amp;sid=1</web_url>


<author_list>
	<author>
	<first_name>E.</first_name>
	<middle_name></middle_name>
	<last_name>Rostami</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email>e_rostami@uk.ac.ir</email>
	<code>10031947532846007039</code>
	<orcid>10031947532846007039</orcid>
	<coreauthor>Yes
</coreauthor>
	<affiliation>Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


	<author>
	<first_name>R. </first_name>
	<middle_name></middle_name>
	<last_name>Nekooei</last_name>
	<suffix></suffix>
	<first_name_fa></first_name_fa>
	<middle_name_fa></middle_name_fa>
	<last_name_fa></last_name_fa>
	<suffix_fa></suffix_fa>
	<email></email>
	<code>10031947532846007040</code>
	<orcid>10031947532846007040</orcid>
	<coreauthor>No</coreauthor>
	<affiliation>Department of Pure Mathematics, Faculty of Mathematics and Computer, Shahid Bahonar University of Kerman</affiliation>
	<affiliation_fa></affiliation_fa>
	 </author>


</author_list>


	</article>
</articleset>
</journal>
