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 und...

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by C(f)={ Tr(af(x)+bx)x ∈ \mathbb Fqm*: a,b Fqm }, where q a prime power, Fqm* = \{0}, Tr trace function from to Fq, and f(x) f(0)=0. Almost bent functions, quadratic some monomials on F2m were used construction, many families binary few weights obt...

The puncturing and shortening technologies are two important approaches to construct new linear codes. It is noticed that many works on punctured codes have been done in the past few decades, but till now little research technique has there only a handful references shortened In this paper, we use technology obtain some from constructed by certain special defining s...

We prove that if two linear codes are equivalent then they semi-linearly equivalent. also additive MDS over a field additively