2019
DOI: 10.1142/s1793830919500307
|View full text |Cite
|
Sign up to set email alerts
|

A note on skew constacyclic codes over 𝔽q + u𝔽q + v𝔽q

Abstract: In this paper, the skew constacyclic codes over finite non-chain ring [Formula: see text], where [Formula: see text], [Formula: see text] is an odd prime and [Formula: see text], are studied. We show that the Gray image of a skew [Formula: see text]-constacyclic code of length [Formula: see text] over [Formula: see text] is a skew quasi-twisted code of length [Formula: see text] over [Formula: see text] of index 3. Further, the structural properties of skew constacyclic codes over [Formula: see text] are obtai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 16 publications
(8 citation statements)
references
References 11 publications
0
8
0
Order By: Relevance
“…Throughout, we fix R = F q +uF q +vF q , u 2 = u, v 2 = v, uv = vu = 0. Now, following [3,12], we recall that R is a semi-local non-chain ring with three maximal ideals 1 − u , 1 − v and u + v . Again, by applying the Chinese Remainder Theorem (CRT) decomposition, we can write R 3 units and q 3 − (q − 1) 3 nonunit elements where the set of units is calculated by the fact that r is a unit in R if and only if r 1 , r 2 , r 3 are non-zero in F q .…”
Section: Preliminarymentioning
confidence: 99%
See 2 more Smart Citations
“…Throughout, we fix R = F q +uF q +vF q , u 2 = u, v 2 = v, uv = vu = 0. Now, following [3,12], we recall that R is a semi-local non-chain ring with three maximal ideals 1 − u , 1 − v and u + v . Again, by applying the Chinese Remainder Theorem (CRT) decomposition, we can write R 3 units and q 3 − (q − 1) 3 nonunit elements where the set of units is calculated by the fact that r is a unit in R if and only if r 1 , r 2 , r 3 are non-zero in F q .…”
Section: Preliminarymentioning
confidence: 99%
“…), for all a, b, c ∈ F q . In addition, we consider another Gray map φ 2 : R → F 3 q defined in [12] by φ 2 (a + ub + vc) = (a, a + b, a + c), for all a, b, c ∈ F q . It is evident to check that φ i is an F q -linear bijective map and can be naturally extended over R n .…”
Section: Preliminarymentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, T. Yao et al also studied the decomposition of skew cyclic code over the finite chain ring H = F q + uF q + vF q + uvF q with u 2 = u, v 2 = v, uv = vu, q = p m , with p odd prime ( according to Frobenius automorphism)( [10]). Later on, H. Islam et al introduced the Frobenius automorphism over H ( [11]). Similarly, A. Dertli et al defined the Gray map from…”
Section: Cuitio Et Al Determined Some Basicmentioning
confidence: 99%
“…Recently, researchers [11,13,14] have studied constacyclic codes over the extension ring Z 4 + uZ 4 of Z 4 and obtained several new linear codes over Z 4 from Gray images of these codes. For more works on the topic, we refer [3,4,[6][7][8].…”
Section: Introductionmentioning
confidence: 99%