MacWilliams extension property for arbitrary weights on linear codes over module alphabets (Q2109390)

Let \(R\) be a finite ring with 1, and consider \(R\)-linear codes defined over a unital left \(R\)-module \(A\) and its assumed that \(A\) is pseudo-injective and has a cyclic socle. The alphabet \(A\) is also equipped with a weight \(w.\) For \(R\)-linear codes \(C_1,C_2 \subseteq A^n\) and \(f : C_1\to C_2\) is an isomorphism of \(R\)-modules that preserves the weight \(w.\) This work asks the following question: under what conditions on \(A\) and \(w\) any such \(f\) extends to a monomial transformation of \(A^n\) that preserves the weight \(w.\) If the functionals \(\lambda_i,\nu_j: M \to A\) give the columns of generator matrices for the codes \(C_1\) and \(C_2\) then \(f\) preserves the weight \(w\) if \(\sum\limits_{i=1}^{n}w(m\lambda_i)=\sum\limits_{j=1}^{n}w(m\nu_j).\) Using the Fourier transform of both sides of the last equation, the authors of this paper have obtained an equation of complex-valued functions on \(\widehat{M}\) that can be written in terms of Fourier transforms of the weight \(w\) along the images of the functionals \(\lambda_i\) and \(\nu_j.\) A sufficient condition is stated requiring the nondegeneracy of matrices defined using the Fourier transform of \(w\) over submodules of \(A.\) A recursive argument builds a weight-preserving monomial transformation between the codes. More specifically, it is determined when two functionals from \(M\) to \(A\) have the same kernel and expressing the Fourier transform of the equation in terms of the Fourier transform of \(w\) along images of functionals. This happens when \(A\) is pseudo-injective, two functionals from \(M\) to \(A\) have the same kernel if and only if the functionals are in the same \(GL_R(A)\)-orbit. The special matrices \(Q^S\) whose nondegeneracy is the sufficient condition in the main theorem are defined. The main theorem states that assuming the matrix \(Q^S\) of has a zero left nullspace for any nonzero left submodule \(S \subseteq A\) then \(A\) has the extension property with respect to the weight \(w.\) Using a recursive argument this statement is proven.