A class of constacyclic codes over \(\frac{\mathbb{F}_{p^m}[u, v]}{\left\langle u^k, v^2, u v-v u\right\rangle}\)

Let \( p \) be a prime number, and let \( k \) and \( m \) be positive integers with \( k \geq 2 \). This paper studies the algebraic structure of \(\lambda\)-constacyclic codes of arbitrary length over the finite commutative ring \( R = \frac{\mathbb{F}_{p^m}[u, v]}{ \langle u^k, v^2, uv - vu \rangle } \), where \(\lambda\) is a unit in \( R \) given by \( \lambda = \sum\limits_{i=0}^{k-1} \lambda_i u^i + v\sum\limits_{i=0}^{k-1} \lambda_i' u^i \), with \(\lambda_i, \lambda_i' \in \mathbb{F}_{p^m}\) and \(\lambda_0, \lambda_1 \neq 0\). We provide a complete classification of these constacyclic codes, determine their dual structures, and compute their Hamming distances when the code length is \( p^s \).

Authors

Publication Details

Journal
Journal of Combinatorial Mathematics and Combinatorial Computing
Published
2025-03-16
DOI
https://doi.org/10.61091/jcmcc124-08
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

A class of constacyclic codes over \(\frac{\mathbb{F}_{p^m}[u, v]}{\left\langle u^k, v^2, u v-v u\right\rangle}\)

Ismail Akharraz, Youssef Ahendouz
Journal of Combinatorial Mathematics and Combinatorial Computing
Coding theory and cryptography
article

A class of constacyclic codes over \(\frac{\mathbb{F}_{p^m}[u, v]}{\left\langle u^k, v^2, u v-v u\right\rangle}\)

Ismail Akharraz, Youssef Ahendouz
article en

Abstract

Let \( p \) be a prime number, and let \( k \) and \( m \) be positive integers with \( k \geq 2 \). This paper studies the algebraic structure of \(\lambda\)-constacyclic codes of arbitrary length over the finite commutative ring \( R = \frac{\mathbb{F}_{p^m}[u, v]}{ \langle u^k, v^2, uv - vu \rangle } \), where \(\lambda\) is a unit in \( R \) given by \( \lambda = \sum\limits_{i=0}^{k-1} \lambda_i u^i + v\sum\limits_{i=0}^{k-1} \lambda_i' u^i \), with \(\lambda_i, \lambda_i' \in \mathbb{F}_{p^m}\) and \(\lambda_0, \lambda_1 \neq 0\). We provide a complete classification of these constacyclic codes, determine their dual structures, and compute their Hamming distances when the code length is \( p^s \).

Journal of Combinatorial Mathematics and Combinatorial ComputingVol. 124
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.