On the equivalence of codes over finite rings (Q1885353)

From MaRDI portal





scientific article; zbMATH DE number 2111569
Language Label Description Also known as
default for all languages
No label defined
    English
    On the equivalence of codes over finite rings
    scientific article; zbMATH DE number 2111569

      Statements

      On the equivalence of codes over finite rings (English)
      0 references
      28 October 2004
      0 references
      Let \(R\) be a finite (not necessarily commutative) ring with identity. The authors call \(R\) a `left (right) MacWilliams ring' if for each \(n\geq 1\) and linear code \(C \subseteq R^n\), every left (right) isometry \(C\rightarrow R^n\) extends to a monomial transformation of \(R^n\). It is well known that finite fields are (left and right) MacWilliams. \textit{J. A. Wood} [Am. J. Math. 121, No. 3, 555--575 (1999; Zbl 0968.94012)] showed that a finite Frobenius ring is MacWilliams and that a finite commutative MacWilliams ring is Frobenius. Here the authors consider whether every finite MacWilliams ring is Frobenius. Their main result is that if \(R\) is a direct sum of local rings or a direct sum of homogeneous semilocal rings then \(R\) is MacWilliams if and only if it is Frobenius. This gives another proof of Wood's results.
      0 references
      equivalence of codes
      0 references
      codes over finite rings
      0 references
      finite Frobenius rings
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references