On Linear Codes over Local Rings of Order p4

Suppose R is a local ring with invariants p,n,r,m,k and mr=4, that is R of order p4. Then, R=R0+uR0+vR0+wR0 has maximal ideal J=uR0+vR0+wR0 of order p(m−1)r and a residue field F of order pr, where R0=GR(pn,r) is the coefficient subring of R. In this article, the goal is to improve the understanding of linear codes over small-order non-chain rings. In particular, we produce the MacWilliams formulas and generator matrices for linear codes of length N over R. In order to accomplish that, we first list all such rings up to isomorphism for different values of p,n,r,m,k. Furthermore, we fully describe the lattice of ideals in R and their orders. Next, for linear codes C over R, we compute the generator matrices and MacWilliams identities, as shown by numerical examples. Given that non-chain rings are not principal ideals rings, it is crucial to acknowledge the difficulties that arise while studying linear codes over them.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-09-30
DOI
https://doi.org/10.3390/math12193069
Citations
7
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.43

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Linear Codes over Local Rings of Order p4

Alhanouf Ali Alhomaidhi, Nawal A. Alsarori, Sami Alabiad
7 citations
Mathematics
Coding theory and cryptography
2.43
article

On Linear Codes over Local Rings of Order p4

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

Abstract

Suppose R is a local ring with invariants p,n,r,m,k and mr=4, that is R of order p4. Then, R=R0+uR0+vR0+wR0 has maximal ideal J=uR0+vR0+wR0 of order p(m−1)r and a residue field F of order pr, where R0=GR(pn,r) is the coefficient subring of R. In this article, the goal is to improve the understanding of linear codes over small-order non-chain rings. In particular, we produce the MacWilliams formulas and generator matrices for linear codes of length N over R. In order to accomplish that, we first list all such rings up to isomorphism for different values of p,n,r,m,k. Furthermore, we fully describe the lattice of ideals in R and their orders. Next, for linear codes C over R, we compute the generator matrices and MacWilliams identities, as shown by numerical examples. Given that non-chain rings are not principal ideals rings, it is crucial to acknowledge the difficulties that arise while studying linear codes over them.

MathematicsVol. 12(19)
Dr. Babasaheb Ambedkar Marathwada University (IN), King Saud University (SA)
King Saud University
Openalex Percentile: Top 9%
Coding theory and cryptography
2.43
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.