Code equivalence characterizes finite Frobenius rings

Jay A. Wood

Proceedings of the American Mathematical Society · 2007 · 53 citations · 11 references

DOIFull text

Open access

Concepts

Abstract

In this paper we show that finite rings for which the code equivalence theorem of MacWilliams is valid for Hamming weight must necessarily be Frobenius. This result makes use of a strategy of Dinh and López-Permouth.

References

11