On Self-Dual Constacyclic Codes of Length 3ps over Fpm+uFpm

Let p be a prime number such that p≥5. In this paper, we classify all self-dual λ-constacyclic codes of length 3ps over the finite commutative ring R=Fpm+uFpm, where u2=0, and λ is a unit in R. For this purpose, the situation of λ is divided into two cases. First, when λ≠λ−1, we prove that there exists a unique self-dual λ-constacyclic code of length 3ps over R, namely the ideal ⟨u⟩. Second, when λ=λ−1, we establish that λ must be either 1 or −1. In this case, two subcases are considered: if pm≡1(mod3), all self-dual codes of length 3ps over R are derived from those of length ps; if pm≡2(mod3), we provide a detailed and explicit characterization of the structure of self-dual codes of length 3ps over R.

Authors

Institutions

Publication Details

Journal
International Journal of Computer Mathematics Computer Systems Theory
Published
2026-06-12
DOI
https://doi.org/10.1080/23799927.2026.2688406
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

On Self-Dual Constacyclic Codes of Length 3ps over Fpm+uFpm

Youssef Ahendouz, Ismail Akharrazy
International Journal of Computer Mathematics Computer Systems Theory
Coding theory and cryptography
article

On Self-Dual Constacyclic Codes of Length 3ps over Fpm+uFpm

Youssef Ahendouz, Ismail Akharrazy
article en

Abstract

Let p be a prime number such that p≥5. In this paper, we classify all self-dual λ-constacyclic codes of length 3ps over the finite commutative ring R=Fpm+uFpm, where u2=0, and λ is a unit in R. For this purpose, the situation of λ is divided into two cases. First, when λ≠λ−1, we prove that there exists a unique self-dual λ-constacyclic code of length 3ps over R, namely the ideal ⟨u⟩. Second, when λ=λ−1, we establish that λ must be either 1 or −1. In this case, two subcases are considered: if pm≡1(mod3), all self-dual codes of length 3ps over R are derived from those of length ps; if pm≡2(mod3), we provide a detailed and explicit characterization of the structure of self-dual codes of length 3ps over R.

International Journal of Computer Mathematics Computer Systems Theory
Université Ibn Zohr (MA), Department of Mathematical Sciences (RU), Institute of Mathematical Statistics (US)
Openalex Percentile: Top 4%
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.