Skew Cyclic Codes Over ℤ<sub>4</sub> + <i>u</i>ℤ<sub>4</sub> With Derivation Based on a New Gray Map and Automorphism

This paper investigates the algebraic structure and properties of skew cyclic codes over the finite chain ring <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> = Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub> + <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i>Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub>, where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i><sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> = 0. A central contribution of this work is the introduction and application of a novel Gray map, establishing a distance-preserving link between codes over <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> and linear codes over Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub>.We employ a specific, compatible pair consisting of a ring automorphism θ and a θ-derivation η to define the appropriate skew polynomial ring structure <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i>[<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x</i>; θ, η]. Within this algebraic framework, we provide a comprehensive analysis of the fundamental structure of free (θ, η)-cyclic codes, detailing their generator polynomial structure and establishing their precise relationship with classical cyclic or quasi-cyclic codes. Furthermore, the structure of Euclidean dual codes for these free codes is examined for even lengths, and a construction for double (θ, η)-cyclic codes from free constituent codes is also presented.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3594631
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Skew Cyclic Codes Over ℤ4 + uℤ4 With Derivation Based on a New Gray Map and Automorphism

Eda Tekin
1 citations
IEEE Access
Coding theory and cryptography
2.48
article

Skew Cyclic Codes Over ℤ4 + uℤ4 With Derivation Based on a New Gray Map and Automorphism

Eda Tekin
article en
1 citations

Abstract

This paper investigates the algebraic structure and properties of skew cyclic codes over the finite chain ring <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> = Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub> + <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i>Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub>, where <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">u</i><sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> = 0. A central contribution of this work is the introduction and application of a novel Gray map, establishing a distance-preserving link between codes over <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i> and linear codes over Z<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">4</sub>.We employ a specific, compatible pair consisting of a ring automorphism θ and a θ-derivation η to define the appropriate skew polynomial ring structure <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</i>[<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">x</i>; θ, η]. Within this algebraic framework, we provide a comprehensive analysis of the fundamental structure of free (θ, η)-cyclic codes, detailing their generator polynomial structure and establishing their precise relationship with classical cyclic or quasi-cyclic codes. Furthermore, the structure of Euclidean dual codes for these free codes is examined for even lengths, and a construction for double (θ, η)-cyclic codes from free constituent codes is also presented.

IEEE AccessVol. 13
X-Fab (Germany) (DE), University of Kara (TG), KTO Karatay University (TR)
Reduced inequalities
Openalex Percentile: Top 9%
Coding theory and cryptography
2.48
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.