On Gray Images of Cyclic and Self-Orthogonal Codes over Fq+uFq+vFq

Let <i>p</i> be a prime with p∉{2,5} and let q=pm. This paper studies cyclic and self-orthogonal linear codes of length <i>n</i> over the finite local non-Frobenius ring Rp,u,v=Fq+uFq+vFq, u2=v2=uv=vu=0. We define an Fq-linear Gray map πn:Rp,u,vn→Fq6n and investigate the structural properties of Gray images of cyclic codes under this map. It is shown that πn preserves self-orthogonality and, when gcd(n,p)=1, transforms any cyclic code over Rp,u,v into a quasi-cyclic code over Fq of length 6n with index dividing 6. Moreover, we completely characterize the possible quasi-cyclic indices of the Gray images, proving that only the values l∈{1,3,6} can occur, and we establish necessary and sufficient conditions for each case in terms of the generators of the associated cyclic code. Several explicit examples are provided to illustrate the theoretical results and the resulting quasi-cyclic structures.

Authors

Institutions

Publication Details

Journal
Entropy
Published
2026-02-22
DOI
https://doi.org/10.3390/e28020250
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Gray Images of Cyclic and Self-Orthogonal Codes over Fq+uFq+vFq

Alhanouf Ali Alhomaidhi, Sami Saif
Entropy
Coding theory and cryptography
article

On Gray Images of Cyclic and Self-Orthogonal Codes over Fq+uFq+vFq

Alhanouf Ali Alhomaidhi, Sami Saif
article en

Abstract

Let <i>p</i> be a prime with p∉{2,5} and let q=pm. This paper studies cyclic and self-orthogonal linear codes of length <i>n</i> over the finite local non-Frobenius ring Rp,u,v=Fq+uFq+vFq, u2=v2=uv=vu=0. We define an Fq-linear Gray map πn:Rp,u,vn→Fq6n and investigate the structural properties of Gray images of cyclic codes under this map. It is shown that πn preserves self-orthogonality and, when gcd(n,p)=1, transforms any cyclic code over Rp,u,v into a quasi-cyclic code over Fq of length 6n with index dividing 6. Moreover, we completely characterize the possible quasi-cyclic indices of the Gray images, proving that only the values l∈{1,3,6} can occur, and we establish necessary and sufficient conditions for each case in terms of the generators of the associated cyclic code. Several explicit examples are provided to illustrate the theoretical results and the resulting quasi-cyclic structures.

EntropyVol. 28(2)
King Saud University (SA)
King Saud University
Openalex Percentile: Top 50%
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.