2018
DOI: 10.3934/amc.2018043
|View full text |Cite
|
Sign up to set email alerts
|

A class of skew-cyclic codes over $\mathbb{Z}_4+u\mathbb{Z}_4$ with derivation

Abstract: In this paper, we study a class of skew-cyclic codes using a skew polynomial ring over R = Z 4 + uZ 4 ; u 2 = 1, with an automorphism θ and a derivation δ θ. We generalize the notion of cyclic codes to skew-cyclic codes with derivation, and call such codes as δ θ-cyclic codes. Some properties of skew polynomial ring R[x, θ, δ θ ] are presented. A δ θ-cyclic code is proved to be a left R[x, θ, δ θ ]-submodule of R[x,θ,δ θ ] x n −1. The form of a parity-check matrix of a free δ θ-cyclic codes of even length n is… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 11 publications
(12 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…This observation brings us to the conclusion that the codes Res(C k ), Tor(C k ), and Φ(C k ) has at most 4 k , 4 k , and 4 2k codewords, respectively. Moreover, the similar observation can also be applied to the code over Z 4 + uZ 4 , with u 2 = 1, investigated by Sharma and Bhaintwal [23] and it is easy to verify that in this case, the codes Res(C k ), Tor(C k ), and Φ(C k ) has at most 4 2k codewords.…”
Section: Applicationmentioning
confidence: 54%
See 3 more Smart Citations
“…This observation brings us to the conclusion that the codes Res(C k ), Tor(C k ), and Φ(C k ) has at most 4 k , 4 k , and 4 2k codewords, respectively. Moreover, the similar observation can also be applied to the code over Z 4 + uZ 4 , with u 2 = 1, investigated by Sharma and Bhaintwal [23] and it is easy to verify that in this case, the codes Res(C k ), Tor(C k ), and Φ(C k ) has at most 4 2k codewords.…”
Section: Applicationmentioning
confidence: 54%
“…They [9] also constructed MDS as well as MRD codes from certain families of the skew cyclic codes. Sharma and Bhaintwal [23] extended the study of these skew cyclic codes over a finite ring, namely over the ring Z 4 + uZ 4 , with u 2 = 1. Via residue codes, Plotkin sum, or the Gray map they [23] defined, several linear codes over Z 4 with good parameters were obtained.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…[25] studied constacyclic codes over Z 4 [u] u 2 −1 , and obtained some optimal codes over Z 4 using Gray maps. Many authors have studied cyclic and constacyclic codes over Z 4 and its extensions and obtained optimal quaternary codes or optimal binary codes via Gray maps [21][22][23]38].…”
Section: Introductionmentioning
confidence: 99%