Repeated-root constacyclic codes of length 3ps over the finite non-chain ring 𝔽pm[u,v] 〈u2,v2,uv−vu〉 and their duals

This study aims to determine the algebraic structures of [Formula: see text]-constacyclic codes of length [Formula: see text] over the finite commutative non-chain ring [Formula: see text], for a prime [Formula: see text] For the unit [Formula: see text], we consider two different instances: when [Formula: see text] is a cube in [Formula: see text] and when it is not. Analyzing the first scenario is relatively easy. When [Formula: see text] is not a unit in [Formula: see text], we consider several subcases and determine the algebraic structures of constacyclic codes in those cases. Further, we also provide the number of codewords and the duals of [Formula: see text]-constacyclic codes.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics Algorithms and Applications
Published
2025-03-26
DOI
https://doi.org/10.1142/s179383092550065x
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

Repeated-root constacyclic codes of length 3ps over the finite non-chain ring 𝔽pm[u,v] 〈u2,v2,uv−vu〉 and their duals

Prasanna Poojary, G. R. Vadiraja Bhatta, D. Acharya
Discrete Mathematics Algorithms and Applications
Coding theory and cryptography
article

Repeated-root constacyclic codes of length 3ps over the finite non-chain ring 𝔽pm[u,v] 〈u2,v2,uv−vu〉 and their duals

Prasanna Poojary, G. R. Vadiraja Bhatta, D. Acharya
article en

Abstract

This study aims to determine the algebraic structures of [Formula: see text]-constacyclic codes of length [Formula: see text] over the finite commutative non-chain ring [Formula: see text], for a prime [Formula: see text] For the unit [Formula: see text], we consider two different instances: when [Formula: see text] is a cube in [Formula: see text] and when it is not. Analyzing the first scenario is relatively easy. When [Formula: see text] is not a unit in [Formula: see text], we consider several subcases and determine the algebraic structures of constacyclic codes in those cases. Further, we also provide the number of codewords and the duals of [Formula: see text]-constacyclic codes.

Discrete Mathematics Algorithms and ApplicationsVol. 17(05)
Manipal Academy of Higher Education (IN)
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.