Code equivalence characterizes finite Frobenius rings

  • Wood J
44Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Wood, J. (2007). Code equivalence characterizes finite Frobenius rings. Proceedings of the American Mathematical Society, 136(2), 699–706. https://doi.org/10.1090/s0002-9939-07-09164-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free