Homogeneous Weights of Linear Codes over 𝔽pm[u, v] of Order p4m

Let R=Fpm[u,v] be the ring whose order is p4m, where p denotes a prime number. The algebraic structure of R is substantially influenced by the relationships among the elements u2, uv, and v2. We establish that R is formed over Fpm when p≠2 and u2=γv2, where γ is a non-zero element of Fpm and uv=0. For p=2, the situations are those where u2=v2=0 and uv≠0. After that, we discuss how to make matrices that are linked to the symmetrical weight enumerators of linear codes over these rings. These matrices are essential in the examination of coding theory over Frobenius rings. Utilizing these matrices makes it possible to determine the homogeneous distances of linear codes over the ring R. Our results show a connection between the uniform distances of linear codes and the matrices of symmetrized weight enumerators. This helps us understand the behavior and characteristics of these codes.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2025-03-15
DOI
https://doi.org/10.3390/sym17030440
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

Homogeneous Weights of Linear Codes over 𝔽pm[u, v] of Order p4m

Alhanouf Ali Alhomaidhi, Sami Alabiad
Symmetry
Coding theory and cryptography
article

Homogeneous Weights of Linear Codes over 𝔽pm[u, v] of Order p4m

Alhanouf Ali Alhomaidhi, Sami Alabiad
article en

Abstract

Let R=Fpm[u,v] be the ring whose order is p4m, where p denotes a prime number. The algebraic structure of R is substantially influenced by the relationships among the elements u2, uv, and v2. We establish that R is formed over Fpm when p≠2 and u2=γv2, where γ is a non-zero element of Fpm and uv=0. For p=2, the situations are those where u2=v2=0 and uv≠0. After that, we discuss how to make matrices that are linked to the symmetrical weight enumerators of linear codes over these rings. These matrices are essential in the examination of coding theory over Frobenius rings. Utilizing these matrices makes it possible to determine the homogeneous distances of linear codes over the ring R. Our results show a connection between the uniform distances of linear codes and the matrices of symmetrized weight enumerators. This helps us understand the behavior and characteristics of these codes.

SymmetryVol. 17(3)
King Saud University (SA)
Openalex Percentile: Top 98%
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.