Frobenius Local Rings of Order p4m

Suppose R is a finite commutative local ring, then it is known that R has four positive integers p,n,m,k called the invariants of R, where p is a prime number. This paper investigates the structure and classification up to isomorphism of local rings with residue field Fpm and of length 4. Specifically, it gives a comprehensive characterization of Frobenius local rings of order p4m. Furthermore, we provide a detailed enumeration of the classes of all such rings with respect to their invariants p,n,m,k. Finite Frobenius rings are particularly advantageous for coding theory. This suitability arises from the fact that two classical theorems by MacWilliams, the Extension Theorem and the MacWilliams relations for symmetrized weight enumerators, can be generalized from finite fields to finite Frobenius rings.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2024-11-02
DOI
https://doi.org/10.3390/sym16111455
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Frobenius Local Rings of Order p4m

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

Frobenius Local Rings of Order p4m

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

Abstract

Suppose R is a finite commutative local ring, then it is known that R has four positive integers p,n,m,k called the invariants of R, where p is a prime number. This paper investigates the structure and classification up to isomorphism of local rings with residue field Fpm and of length 4. Specifically, it gives a comprehensive characterization of Frobenius local rings of order p4m. Furthermore, we provide a detailed enumeration of the classes of all such rings with respect to their invariants p,n,m,k. Finite Frobenius rings are particularly advantageous for coding theory. This suitability arises from the fact that two classical theorems by MacWilliams, the Extension Theorem and the MacWilliams relations for symmetrized weight enumerators, can be generalized from finite fields to finite Frobenius rings.

SymmetryVol. 16(11)
Dr. Babasaheb Ambedkar Marathwada University (IN), King Saud University (SA)
Openalex Percentile: Top 83%
Coding theory and cryptography
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.