Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem (Q700162): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/ffta.2001.0343 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2006013398 / rank | |||
Normal rank |
Revision as of 02:33, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem |
scientific article |
Statements
Orthogonality matrices for modules over finite Frobenius rings and MacWilliams' equivalence theorem (English)
0 references
30 September 2002
0 references
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.
0 references
linear codes over rings
0 references
Frobenius rings
0 references
MacWilliams equivalence theorem
0 references
homogeneous weights
0 references
Möbius inversion on posets
0 references