Research ArticlesNo Access

Extension theorems for various weight functions over Frobenius bimodules

Heide Gluesing-Luerssen

Department of Mathematics, University of Kentucky, Lexington, KY 40506, USA

E-mail Address: heide.gl@uky.edu

Corresponding author.

Search for more papers by this author

and

Tefjol Pllaha

Department of Mathematics, University of Kentucky, Lexington, KY 40506, USA

E-mail Address: tefjol.pllaha@uky.edu

Search for more papers by this author

https://doi.org/10.1142/S0219498818500524Cited by:5 (Source: Crossref)

Abstract

In this paper, we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for partitions on Frobenius bimodules, we derive alternative proofs for the facts that the Hamming weight and the homogeneous weight satisfy the extension property. We also use the same techniques to derive the extension property for other weights, such as the Rosenbloom–Tsfasman weight.

Communicated by S. R. López-Permouth

Keywords:

AMSC: 94B05, 16L60, 16P10

References

1. A. Barra and H. Gluesing-Luerssen , MacWilliams extension theorems and the local-global property for codes over Frobenius rings, J. Pure Appl. Algebra 219 (2015) 703–728. Crossref, Web of Science, Google Scholar
2. R. A. Brualdi, J. Graves and K. M. Lawrence , Codes with a poset metric, Discrete. Math. 147 (1995) 57–72. Crossref, Web of Science, Google Scholar
3. H. L. Claasen and R. W. Goldbach , A field-like property of finite rings, Indag. Math., 3 (1992) 11–26. Crossref, Web of Science, Google Scholar
4. H. Q. Dinh and S. López-Permouth , On the equivalence of codes over finite rings, Appl. Algebra En. Comm. Comput. 15 (2004) 37–50. Crossref, Web of Science, Google Scholar
5. S. Dyshko , On extendibility of additive code isometries, in Coding Theory and Applications, CIM Series in Mathematical Sciences, eds. R. Pinto, P. Rocha Malonek and P. Vettori , Vol. 3 (Springer, 2015), pp. 169–175. Crossref, Google Scholar
6. N. ElGarem, N. Megahed and J. A. Wood , The extension theorem with respect to symmetrized weight compositions, in Coding Theory and Applications, CIM Series in Mathematical Sciences, eds. R. Pinto, P. Rocha Malonek and P. Vettori , Vol. 3 (Springer, 2015), pp. 177–183. Crossref, Google Scholar
7. H. Gluesing-Luerssen , Partitions of Frobenius rings induced by the homogeneous weight, Adv. Math. Commun. 8 (2014) 191–207. Crossref, Web of Science, Google Scholar
8. H. Gluesing-Luerssen , Fourier-reflexive partitions and MacWilliams identities for additive codes, Des. Codes Cryptogr. 75 (2015) 543–563. Crossref, Web of Science, Google Scholar
9. M. Greferath, A. Nechaev and R. Wisbauer , Finite quasi-Frobenius modules and linear codes, J. Algebra Appl. 3 (2004) 247–272. Link, Web of Science, Google Scholar
10. Y. Hirano , On admissible rings, Indag. Math. 8 (1997) 55–59. Crossref, Web of Science, Google Scholar
11. T. Honold , Characterization of finite Frobenius rings, Arch. Math. 76 (2001) 406–415. Crossref, Web of Science, Google Scholar
12. T. Honold , Two-intersection sets in projective Hjelmslev spaces, in Proc. 19th Int. Symp. Mathematical Theory of Networks and Systems, Budapest, Hungary, 2010, pp. 1807–1813. Google Scholar
13. H. Kim and D. Oh , A classification of posets admitting the MacWilliams identity, IEEE Trans. Inform. Theory IT-51 (2005) 1424–1431. Crossref, Web of Science, Google Scholar
14. T. Y. Lam , Lectures on Modules and Rings, Graduate Text in Mathematics, Vol. 189 (Springer, 1999). Crossref, Google Scholar
15. E. Lamprecht , Über I-reguläre Ringe, reguläre Ideale und Erklärungsmoduln, I. Math. Nachr. 10 (1953) 353–382. Crossref, Google Scholar
16. F. J. MacWilliams, Combinatorial problems of elementary abelian groups, PhD thesis, Harvard University (1962). Google Scholar
17. F. J. MacWilliams and N. J. A. Sloane , The Theory of Error-Correcting Codes (North-Holland, 1977). Google Scholar
18. L. Panek, M. Firer, H.-K. Kim and J.-Y. Hyun , Groups of linear isometries on poset structures, Discrete Math. 308 (2008) 4116–4123. Crossref, Web of Science, Google Scholar
19. M. Rosenbloom and M. Tsfasman , Codes for the $m$ -metric, Problemy Peredachi Informatsii 33(1) (1997) 55–63. Google Scholar
20. M. Skriganov , On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics, J. Complexity 23 (2007) 926–936. Crossref, Web of Science, Google Scholar
21. J. A. Wood , Extension theorems for linear codes over finite rings, in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, eds. T. Mora and H. Mattson , Vol. 1255 (Springer, Berlin, 1997), pp. 329–340. Crossref, Google Scholar
22. J. A. Wood , Duality for modules over finite rings and applications to coding theory, Amer. J. Math. 121 (1999) 555–575. Crossref, Web of Science, Google Scholar
23. J. A. Wood , Foundations of linear codes defined over finite modules: The extension theorem and the MacWilliams identities, in Codes Over Rings, Proceedings of the CIMPA Summer School, Ankara (2008), Series on Coding Theory and Crytology, ed. P. Solé , Vol. 6 (World Scientific, Singapore, 2009) pp. 124–190. Link, Google Scholar
24. J. A. Wood , Relative one-weight linear codes, Des. Codes Cryptogr. 72 (2014) 331–344. Crossref, Web of Science, Google Scholar