Code equivalence characterizes finite Frobenius rings

Wood, Jay

doi:10.1090/S0002-9939-07-09164-2

Code equivalence characterizes finite Frobenius rings
HTML articles powered by AMS MathViewer

by Jay A. Wood PDF

Proc. Amer. Math. Soc. 136 (2008), 699-706 Request permission

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

George E. Andrews, The theory of partitions, Encyclopedia of Mathematics and its Applications, Vol. 2, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1976. MR 0557013
Kenneth Bogart, Don Goldberg, and Jean Gordon, An elementary proof of the MacWilliams theorem on equivalence of codes, Information and Control 37 (1978), no. 1, 19–22. MR 479646
Hai Quang Dinh and Sergio R. López-Permouth, On the equivalence of codes over finite rings, Appl. Algebra Engrg. Comm. Comput. 15 (2004), no. 1, 37–50. MR 2142429, DOI 10.1007/s00200-004-0149-5
Hai Quang Dinh and Sergio R. López-Permouth, On the equivalence of codes over rings and modules, Finite Fields Appl. 10 (2004), no. 4, 615–625. MR 2094161, DOI 10.1016/j.ffa.2004.01.001
Marcus Greferath, Alexandr Nechaev, and Robert Wisbauer, Finite quasi-Frobenius modules and linear codes, J. Algebra Appl. 3 (2004), no. 3, 247–272. MR 2096449, DOI 10.1142/S0219498804000873
M. Greferath and S. E. Schmidt, Finite-ring combinatorics and MacWilliams’ equivalence theorem, J. Combin. Theory Ser. A 92 (2000), no. 1, 17–28. MR 1783936, DOI 10.1006/jcta.1999.3033
Thomas Honold, Characterization of finite Frobenius rings, Arch. Math. (Basel) 76 (2001), no. 6, 406–415. MR 1831096, DOI 10.1007/PL00000451
V. L. Kurakin, A. S. Kuzmin, V. T. Markov, A. V. Mikhalev, and A. A. Nechaev, Linear codes and polylinear recurrences over finite rings and modules (a survey), Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999) Lecture Notes in Comput. Sci., vol. 1719, Springer, Berlin, 1999, pp. 365–391. MR 1846512, DOI 10.1007/3-540-46796-3_{3}6
T. Y. Lam, Lectures on modules and rings, Graduate Texts in Mathematics, vol. 189, Springer-Verlag, New York, 1999. MR 1653294, DOI 10.1007/978-1-4612-0525-8
Jessie MacWilliams, Error-correcting codes for multiple-level transmission, Bell System Tech. J. 40 (1961), 281–308. MR 141541, DOI 10.1002/j.1538-7305.1961.tb03986.x
—, Combinatorial properties of elementary abelian groups, Ph.D. thesis, Radcliffe College, Cambridge, Mass., 1962.
Tadasi Nakayama, On Frobeniusean algebras. I, Ann. of Math. (2) 40 (1939), 611–633. MR 16, DOI 10.2307/1968946
Tadasi Nakayama, On Frobeniusean algebras. II, Ann. of Math. (2) 42 (1941), 1–21. MR 4237, DOI 10.2307/1968984
J. H. van Lint and R. M. Wilson, A course in combinatorics, Cambridge University Press, Cambridge, 1992. MR 1207813
Harold N. Ward and Jay A. Wood, Characters and the equivalence of codes, J. Combin. Theory Ser. A 73 (1996), no. 2, 348–352. MR 1370137
Jay A. Wood, Duality for modules over finite rings and applications to coding theory, Amer. J. Math. 121 (1999), no. 3, 555–575. MR 1738408