Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem (Q700162): Difference between revisions

Two important theorems were proven in the thesis of F.J. MacWilliams. The first is well known and relates the weight enumerator of a code and the weight enumerator of its dual. The second is the MacWilliams equivalence theorem, which states that Hamming isometries between linear codes over fields can be extended to monomial transformations of the ambient space. This result was first generalized to finite Frobenius rings by \textit{J. Wood} [Am. J. Math. 121, 555-575 (1999; Zbl 0968.94012)] using character theoretic methods. In this paper, the author revises the proof of the result for codes over fields given by \textit{K. P. Bogart, D. Goldberg} and \textit{J. Gordon} [Inf. Control 37, 19-22 (1978; Zbl 0382.94021)], which uses the invertibility of orthogonal matrices, to give an elegant proof of the MacWilliams equivalence theorem for codes over finite Frobenius rings.