Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm
Let u,v, and w be indeterminates over Fpm and let R=Fpm+uFpm+vFpm+wFpm, where p is a prime. Then, R is a ring of order p4m, and R≅Fpm[u,v,w]I with maximal ideal J=uFpm+vFpm+wFpm of order p3m and a residue field Fpm of order pm, where I is an appropriate ideal. In this article, the goal is to improve the understanding of linear codes over local non-chain rings. In particular, we investigate the symmetrized weight enumerators and generator matrices of linear codes of length N over R. In order to accomplish that, we first list all such rings up to the isomorphism for different values of the index of nilpotency l of J, 2≤l≤4. Furthermore, we fully describe the lattice of ideals of R and their orders. Next, for linear codes C over R, we compute the generator matrices and symmetrized weight enumerators, as shown by numerical examples.
Authors
- Alhanouf Ali Alhomaidhi (ORCID: https://orcid.org/0009-0002-2520-2699)
- Nawal A. Alsarori (ORCID: https://orcid.org/0000-0002-9691-4979)
- Sami Alabiad (ORCID: https://orcid.org/0000-0002-6824-6985)
Institutions
- Dr. Babasaheb Ambedkar Marathwada University (IN)
- King Saud University (SA)
Publication Details
- Journal
- Symmetry
- Published
- 2024-09-06
- DOI
- https://doi.org/10.3390/sym16091169
- Citations
- 3
- Primary Topic
- Coding theory and cryptography
- Type
- article
- Field-Weighted Citation Impact
- 1.04