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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm

Alhanouf Ali Alhomaidhi, Nawal A. Alsarori, Sami Alabiad
3 citations
Symmetry
Coding theory and cryptography
1.04
article

Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm

Alhanouf Ali Alhomaidhi, Nawal A. Alsarori, Sami Alabiad
article en
3 citations

Abstract

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.

SymmetryVol. 16(9)
Dr. Babasaheb Ambedkar Marathwada University (IN), King Saud University (SA)
Openalex Percentile: Top 19%
Coding theory and cryptography
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Generator Matrices and Symmetrized Weight Enumerators of Linear Codes over Fpm + uFpm + vFpm + wFpm — Alhanouf Ali Alhomaidhi, Nawal A. Alsarori, et al. · Symmetry (2024) | TGRS Research Map | TGRS