Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem

DOI10.1006/FFTA.2001.0343MaRDI QIDQ700162zbMATH OpenOpenAlexFDO

Authors Marcus Greferath

Publication date 30 September 2002

Published in Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/ffta.2001.0343

zbMATH Keywords

Frobenius ringshomogeneous weightslinear codes over ringsMacWilliams equivalence theoremMöbius inversion on posets

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Review text

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.

Recommendations

• Finite-ring combinatorics and MacWilliams' equivalence theorem
• On the equivalence of codes over rings and modules
• MacWilliams extension theorems and the local-global property for codes over Frobenius rings
• Code equivalence characterizes finite Frobenius rings
• On the equivalence of codes over finite rings

Cites work

• A metric for codes over residue class rings
• An elementary proof of the MacWilliams theorem on equivalence of codes
• Combinatorial theory.
• Duality for modules over finite rings and applications to coding theory
• Finite-ring combinatorics and MacWilliams' equivalence theorem
• Gray isometries for finite chain rings and a nonlinear ternary (36, 3/sup 12/, 15) code
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• Kerdock code in a cyclic form
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Weighted modules and representations of codes

Cited in

(8)

• Finite-ring combinatorics and MacWilliams' equivalence theorem
• On the equivalence of codes over finite rings
• MacWilliams extension property for arbitrary weights on linear codes over module alphabets
• Relative one-weight linear codes
• The extension theorem for Lee and Euclidean weight codes over integer residue rings
• MacWilliams' extension theorem for bi-invariant weights over finite principal ideal rings
• On linear codes over finite rings and modules
• Code equivalence characterizes finite Frobenius rings

This page was built for publication: Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q700162)