Skip to main content
Log in

Abstract.

It is known that if a finite ring R is Frobenius then equivalences of linear codes over R are always monomial transformations. Among other results, in this paper we show that the converse of this result holds for finite local and homogeneous semilocal rings. Namely, it is shown that for every finite ring R which is a direct sum of local and homogeneous semilocal subrings, if every Hamming-weight preserving R-linear transformation of a codeC 1 onto a code C 2 is a monomial transformation then R is a Frobenius ring.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bachoc, C.: Applications of Coding Theory to the Construction of Modular Lattices. J. Combin. Theory Ser. A, 78, 92–119 (1997)

    Google Scholar 

  2. Bogart, K., Goldberg, D., Gordon, J.: An elementary proof of the MacWilliams theorem on equivalence of codes. Inform. and Control 37, 19–22 (1978)

    MATH  Google Scholar 

  3. Calderbank, A.R., Hammons, Jr., A.R., Kumar, P.V., Sloane, N.J. A., Solé, P.: A linear construction for certain Kerdock and Preparata codes. Bull. AMS 29, 218–222 (1993)

    MathSciNet  MATH  Google Scholar 

  4. Calderbank, A.R., Hammons, Jr., A.R., Kumar, P.V., Sloane, N.J. A., Solé, P.: The ℤ4-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inform. Theory, 40, 301–319 (1994)

    Google Scholar 

  5. Calderbank, A.R., Sloane, N.J.A.: Modular and p-adic codes. Designs, Codes and Cryptography. 6, 21–35 (1995)

    Google Scholar 

  6. Conway, J.H., Sloane, N.J.A.: Self-dual codes over the integers modulo 4. J. Combin. Theory Ser. A 62, 30–45 (1993)

    MathSciNet  MATH  Google Scholar 

  7. Corisello, R., Facchini, A.: Homogeneous semilocal rings. Comm. Algebra 29(4), 1807–1819 (2001)

    Article  MATH  Google Scholar 

  8. Dinh, H.Q.: A note on Pseudo-injective modules. to appear in Comm. Algebra

  9. Dinh, H.Q., López-Permouth, S.R.: On the Equivalence of Codes over Rings and Modules. to appear in Finite Fields & Appl.

  10. Dinh, H.Q., López-Permouth, S.R.: Cyclic and Negacyclic Codes over Finite Chain Rings, to appear in IEEE Trans. Inform. Theory

  11. Faith, C.: Algebra II: Ring Theory. Grundl. Math. Wiss. Vol. 191, Springer-Verlag, (1976)

  12. Faith, C., Huynh, D.V.: When self-injective rings are quasi-Frobenius: A report on a problem. J. Alg. & Appl., 1, 75–105 (2002)

    Google Scholar 

  13. Greferath, M., Schmidt, S.E.: Finite Ring Combinatorics and MacWilliams’s Equivalence Theorem. J. Combin. Theory Ser. A 92, 17–28 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  14. Greferath, M., Schmidt, S.E.: Linear codes and rings of matrices. Applied algebra, algebraic algorithms and error-correcting codes (Honolulu, HI, 1999), 160-169, Lecture Notes in Comput. Sci., 1719, Springer, Berlin, 1999

  15. Honold, T.: Characterization of finite Frobenius rings. Arch. Math. 76, 406–415 (2001)

    MathSciNet  MATH  Google Scholar 

  16. Jain, S.K., Singh, S.: Quasi-injective and Pseudo-injective Modules. Canad. Math. Bull. 18, 359–366 (1975)

    MATH  Google Scholar 

  17. Kanwar, P., López-Permouth, S.R.: Cyclic Codes over the Integers Modulo p m. Finite Fields & Appl. 3, 334–352 (1997)

    Google Scholar 

  18. Lam, T.Y.: Lectures on Modules and Rings. Graduate Text in Mathematics, Vol. 189, Springer-Verlag, 1999

  19. Lam, T.Y.: A First Course in Noncommutative Rings. Graduate Text in Mathematics, Vol. 131, Second edition, Springer-Verlag, 2001

  20. MacWilliams, F.J.: Error-correcting codes for multiple-level transmissions. Bell System Tech. J. 40, 281–308 (1961)

    Google Scholar 

  21. MacWilliams, F.J.: Combinatorial problems of elementary abelian groups. PhD. Dissertation, Harvard University, Cambridge, MA, 1962

  22. McDonald, B.R.: Finite Rings with Identity. Pure and Applied Mathematics, Vol. 28, Marcel Dekker, New York, 1974

  23. Nakayama, T.: On Frobeniusean Algebras, I. Annals of Math. 40, 611–633 (1939)

    MathSciNet  MATH  Google Scholar 

  24. Nakayama, T.: On Frobeniusean Algebras, II. Annals of Math. 42, 1–21 (1941)

    MathSciNet  Google Scholar 

  25. Nechaev, A.A.: Trace functions in Galois ring and noise stable codes (in Russian). V All-Union Symp. on theory of rings, algebras and modules, Novosibirsk, 1982, pp. 97

  26. Nechaev, A.A.: Kerdock code in a cyclic form, (in Russian), Diskr. Math. (USSR), 1, No. 4, 1989, 123-139. English translation: Discrete Math. and Appl. 1(4), 365–384 (1991)

    MATH  Google Scholar 

  27. Norton, G., Sălăgean-Mandache, A.: On the structure of linear cyclic codes over finite chain rings. Appl. Algebra Engrg. Comm. Comput. 10(6), 489–506 (2000)

    Google Scholar 

  28. Pless, V., Qian, Z.: Cyclic codes and quadratic codes over ℤ4. IEEE Trans. Inform. Theory, 42, 1594–1600 (1996)

    Google Scholar 

  29. Pless, V., Qian, Z.: Cyclic self-dual ℤ4-codes. Finite Fields & Appl. 3, 48–69 (1997)

    Google Scholar 

  30. Singh, S., Jain, S.K.: On pseudo-injective modules and pseudo-injective rings. J. Math. Sci. 2, 23–31 (1967)

    Google Scholar 

  31. Teply, M.L.: Pseudo-injective modules which are not quasi-injective. Proc. Am. Math. Soc., 49, 305–310 (1975)

    Google Scholar 

  32. Ward, H.N., Wood, J.A.: Characters and the equivalence of codes. J. Combin. Theory Ser. A 73, 348–352 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  33. Wood, J.A.: Extension theorems for linear codes over finite rings. Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (T. Mora and H. Mattson, eds.), Springer Verlag, 1997, 329–340

  34. Wood, J.A.: Duality for modules over finite rings and applications to coding theory. American J. of Math. 121, 555–575 (1999)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sergio R. López-Permouth.

Additional information

Partially supported by Center of Ring Theory and Applications, Ohio University.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Quang Dinh, H., López-Permouth, S. On the Equivalence of Codes over Finite Rings. AAECC 15, 37–50 (2004). https://doi.org/10.1007/s00200-004-0149-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-004-0149-5

Keywords

Navigation