TY - JOUR T1 - Computation of Minimum Hamming Weight for Linear Codes TT - JF - IJMSI JO - IJMSI VL - 14 IS - 1 UR - http://ijmsi.ir/article-1-944-en.html Y1 - 2019 SP - 81 EP - 93 KW - Algebraic coding theory KW - Linear codes KW - Quasi-Frobenius rings KW - Grobner basis KW - SPAP-rings. N2 - 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$ 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. M3 ER -