2021
DOI: 10.3390/math9202554
|View full text |Cite
|
Sign up to set email alerts
|

Symbol-Pair Distance of Repeated-Root Constacyclic Codes of Prime Power Lengths over \({{\mathbb{F}_{p^m}[u]}/{\langle u^3\rangle}}\)

Abstract: Let p be a prime, s, m be positive integers, γ be a nonzero element of the finite field Fpm, and let R=Fpm[u]/⟨u3⟩ be the finite commutative chain ring. In this paper, the symbol-pair distances of all γ-constacyclic codes of length ps over R are completely determined.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 28 publications
0
1
0
Order By: Relevance
“…Then, their Hamming distances have been computed by Dinh et al [22]. In [23], Charkani et al computed their symbol-pair distances.…”
Section: Introductionmentioning
confidence: 99%
“…Then, their Hamming distances have been computed by Dinh et al [22]. In [23], Charkani et al computed their symbol-pair distances.…”
Section: Introductionmentioning
confidence: 99%