On Gray Images of Cyclic and Self-Orthogonal Codes over 𝔽q + u𝔽q + v𝔽q

TL;DR

This paper explores how certain types of codes over a specific ring can be transformed into quasi-cyclic codes using a Gray map, preserving important properties like self-orthogonality.

Contribution

The paper introduces a Gray map for codes over a non-Frobenius ring and characterizes the resulting quasi-cyclic indices and their conditions.

Findings

The Gray map preserves self-orthogonality of codes over the ring Rp,u,v.

When gcd(n,p)=1, the Gray image of a cyclic code becomes a quasi-cyclic code of length 6n with index dividing 6.

Only quasi-cyclic indices 1, 3, and 6 are possible, with conditions derived from the code's generators.

Abstract

Let p be a prime with p∉{2,5} and let q=pm. This paper studies cyclic and self-orthogonal linear codes of length n 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.

Full text

1. Introduction

Cyclic codes have been a central object of study in algebraic coding theory for several decades due to their strong algebraic structure and efficient implementation in communication and storage systems [1]. Their invariance under cyclic shifts allows a polynomial representation that facilitates both structural analysis and decoding. Quasi-cyclic codes arise as a natural generalization by requiring invariance under a fixed power of the shift operator, and they form a broad class of linear codes containing many families with good algebraic and combinatorial properties [2,3,4]. In particular, several important subclasses of linear codes, including constacyclic and linear complementary dual (LCD) codes, naturally embed within the quasi-cyclic framework [5,6,7,8].

The interaction between ring theory and coding theory gained significant momentum with the seminal work of Hammons et al. [9], who demonstrated that several classical nonlinear binary codes can be realized as Gray images of linear codes over $[eqn]$ . This discovery initiated extensive research on linear codes over finite rings and on Gray maps as structure-preserving transformations linking codes over rings to codes over finite fields. Subsequent studies examined cyclic and constacyclic codes over rings such as $[eqn]$ and $[eqn]$ , with particular emphasis on determining when Gray images preserve cyclic or quasi-cyclic structures [10,11,12].

The algebraic structure of quasi-cyclic codes over finite fields was further clarified by Ling and Solé [11], who developed a module-theoretic framework based on polynomial quotient rings and the Chinese Remainder Theorem. Their approach enabled systematic classification results and influenced a wide range of subsequent studies. These ideas were later extended to codes over finite chain rings and, more recently, to non-chain and non-Frobenius rings, leading to new families of cyclic and quasi-cyclic codes with additional algebraic constraints [13,14,15,16]. Despite this progress, the behavior of Gray images of cyclic codes over non-Frobenius rings remains significantly less understood than in classical chain-ring or Frobenius settings.

From a structural viewpoint, non-Frobenius rings are of particular interest because many of the standard tools used in coding theory, such as canonical duality, MacWilliams-type identities, and decomposition techniques, either fail to apply or behave fundamentally differently compared with the Frobenius or chain-ring cases [17,18]. As a result, algebraic properties such as cyclicity, quasi-cyclicity, and self-orthogonality cannot, in general, be transferred automatically from codes over the ring to their images over finite fields via Gray maps, even when the maps are linear and distance-preserving. Determining which algebraic invariances are preserved under such mappings and which are lost therefore becomes a genuine structural problem rather than a routine extension of known results, particularly in the setting of non-chain and non-Frobenius rings [19,20,21].

In this paper, we study cyclic codes over the finite commutative local non-Frobenius ring

$$[eqn]$$

where $[eqn]$ and p is a prime. This ring is not a chain ring and does not admit a linear ordering of ideals, which leads to structural phenomena that do not arise in more classical settings. In particular, cyclic codes over $[eqn]$ may involve multiple interacting nilpotent components, making the analysis of their Gray images more delicate than in previously studied ring families.

The motivation for the present work is to obtain a precise structural understanding of how cyclic and self-orthogonal codes over $[eqn]$ behave under Gray mappings into vector spaces over finite fields. Gray maps have long been recognized as fundamental tools for relating codes over rings to classical linear codes over fields [9]. Building on this idea, we introduce an explicit $[eqn]$ -linear Gray map from $[eqn]$ to $[eqn]$ and study its interaction with cyclic shift operators and Euclidean duality. Under the natural assumption $[eqn]$ , we show that the Gray image of any cyclic code over $[eqn]$ is necessarily a quasi-cyclic code over $[eqn]$ with index dividing 6, extending known quasi-cyclic behavior of Gray images from chain-ring and related settings to the present non-Frobenius context [2,22].

A central result of this work is the complete classification of the quasi-cyclic indices that can arise from Gray images of cyclic codes over $[eqn]$ . We prove that only the values 1, 3, and 6 are possible, and we establish necessary and sufficient conditions for each case in terms of the generators of the associated cyclic codes. In addition, we show that self-orthogonality is preserved under the proposed Gray map, despite the absence of the Frobenius property in the underlying ring. These results provide a unified structural description of the relationship between cyclic codes over $[eqn]$ and their Gray images over finite fields.

The remainder of the paper is organized as follows. In Section 2, we recall basic properties of the ring $[eqn]$ and introduce the Gray map used throughout the paper. Section 3 contains the main results concerning the quasi-cyclic structure and self-orthogonality of Gray images of cyclic codes, assuming $[eqn]$ . In Section 4, we present explicit examples and generator matrices illustrating the different quasi-cyclic behaviors predicted by the theoretical results.

2. Preliminaries

Let p be a prime number and let m be a positive integer. Set $[eqn]$ and denote by $[eqn]$ the finite field with q elements. Throughout this paper, we work over the finite commutative ring

$$[eqn]$$

which can be identified with the $[eqn]$ -algebra $[eqn]$ , where the indeterminates satisfy $[eqn]$ . The ring $[eqn]$ is local with unique maximal ideal

$$[eqn]$$

and it is not Frobenius. In particular, it does not admit the usual duality properties available for finite Frobenius or chain rings.

Let $[eqn]$ be a generator of the multiplicative group $[eqn]$ of order $[eqn]$ . The associated Teichmüller set is defined by

$$[eqn]$$

Every element $[eqn]$ admits a unique representation of the form

$$[eqn]$$

An element z is a unit in $[eqn]$ if and only if its constant component f is nonzero in $[eqn]$ . This simple characterization of units plays an important role in the algebraic description of codes over $[eqn]$ .

A linear code $[eqn]$ of length n over $[eqn]$ is an $[eqn]$ -submodule of $[eqn]$ . Codewords are written as n-tuples $[eqn]$ with $[eqn]$ . The cyclic shift operator on $[eqn]$ is defined by

$$[eqn]$$

A code $[eqn]$ is said to be cyclic if it is invariant under $[eqn]$ . More generally, for a positive integer l, a code of length $[eqn]$ over $[eqn]$ is called quasi-cyclic of index l if it is invariant under the l-fold shift $[eqn]$ . The case $[eqn]$ corresponds to classical cyclic codes.

There is a standard polynomial representation that identifies $[eqn]$ with the quotient module

$$[eqn]$$

via the correspondence

$$[eqn]$$

Under this identification, cyclic codes of length n over $[eqn]$ correspond precisely to ideals of $[eqn]$ , allowing the study of cyclic codes to be reduced to an ideal-theoretic problem in a polynomial quotient ring [23,24,25]. Duality also plays a central role in the study of codes over $[eqn]$ . For vectors $[eqn]$ and $[eqn]$ in $[eqn]$ , the Euclidean inner product is defined by

$$[eqn]$$

The dual code of $[eqn]$ is then given by

$$[eqn]$$

A code $[eqn]$ is called self-orthogonal if $[eqn]$ , and self-dual if $[eqn]$ . These notions will be essential in the analysis of Gray images in subsequent sections.

3. Main Results

In this work, we fix n to be a positive integer such that $[eqn]$ , with the additional restriction that $[eqn]$ . The following result plays a central role in our investigation, as it provides a complete description of the algebraic structure of the ideals in the quotient ring

$$[eqn]$$

which in turn characterizes all cyclic codes of length n over $[eqn]$ . We therefore begin by formally stating this fundamental outcome.

Since cyclic codes are a special case of constacyclic codes, the structural description established in (Theorem 1 in (p. 4, [2])) applies directly in our setting. Thus, we state the following result.

Theorem 1. Let $[eqn]$ A cyclic code $[eqn]$ of length n over $[eqn]$ has a corresponding ideal of the form

$$[eqn]$$

where the polynomials satisfy

$$[eqn]$$

We begin by recalling the notion and some fundamental properties of the quadratic character of a finite field. The quadratic character of the multiplicative group $[eqn]$ is the function

$$[eqn]$$

defined by setting $[eqn]$ if t is a nonzero square in $[eqn]$ and $[eqn]$ if t is a nonsquare. For example, we clearly have $[eqn]$ , while $[eqn]$ , where $[eqn]$ denotes a fixed generator of $[eqn]$ . It is well known that

$$[eqn]$$

To extend this function to the entire field $[eqn]$ , we adopt the convention $[eqn]$ . With this extension, the quadratic character admits the compact expression

$$[eqn]$$

In the remainder of this work, the symbol $[eqn]$ will consistently denote the quadratic character of $[eqn]$ .

Lemma 1. Let $[eqn]$ with odd prime p. The number N of solutions $[eqn]$ to

$$[eqn]$$

is

$$[eqn]$$

Proof. Let $[eqn]$ be a fixed nontrivial additive character and $[eqn]$ be the quadratic character on $[eqn]$ (extended by $[eqn]$ ). Using the standard additive-character indicator,

$$[eqn]$$

we can write

$$[eqn]$$

For $[eqn]$ the inner sums are both q, giving the contribution q. For $[eqn]$ , the quadratic Gauss sum identity yields

$$[eqn]$$

so the $[eqn]$ terms contribute

$$[eqn]$$

because $[eqn]$ . The fundamental relation for quadratic Gauss sums states $[eqn]$ . Substituting this gives

$$[eqn]$$

Finally, $[eqn]$ if and only if $[eqn]$ is a square in $[eqn]$ , which holds exactly when $[eqn]$ ; otherwise, $[eqn]$ and $[eqn]$ . This yields the stated cases. □

Given $[eqn]$ , we write $[eqn]$ where $[eqn]$ Similarly, for $[eqn]$ , we have

$$[eqn]$$

where $[eqn]$ are elements of $[eqn]$

Definition 1. Let p be a prime with $[eqn]$ , and let $[eqn]$ be a cyclic code of length n over $[eqn]$ . Fix $[eqn]$ with $[eqn]$ .

(i)  Gray maps and Lee weight: For $[eqn]$ , we define

$$[eqn]$$ $$[eqn]$$

extended to $[eqn]$ componentwise. (ii)  Matrix representation: For $[eqn]$ ,

$$[eqn]$$

For $[eqn]$ :

$$[eqn]$$

(iii)  Shift map: For $[eqn]$ ,

$$[eqn]$$

For instance, if $[eqn]$ then we have

$$[eqn]$$

Remark 1. The quadratic constraint $[eqn]$ arises from the requirement that the Gray map $[eqn]$ be compatible with the Lee weight on $[eqn]$ and the Hamming weight on $[eqn]$ . In particular, this relation ensures that the Gray map preserves orthogonality and yields the desired quasi-cyclic structure of the image codes. The exclusion of $[eqn]$ guarantees that non-degenerate solutions $[eqn]$ satisfying this quadratic constraint exist.

Theorem 2. Let $[eqn]$ be a self-orthogonal cyclic code over $[eqn]$ of length n. Then, its Gray image $[eqn]$ is also self-orthogonal.

Proof. Suppose that $[eqn]$ is a self-orthogonal cyclic code over $[eqn]$ of length n. By definition, this means $[eqn]$ . We claim that

$$[eqn]$$

Take arbitrary codewords $[eqn]$ and $[eqn]$ . Each $[eqn]$ can be expressed in the form

$$[eqn]$$

Since $[eqn]$ , we obtain the orthogonality conditions

$$[eqn]$$

Now, consider their Gray images under $[eqn]$ . A direct computation yields

$$[eqn]$$

Using the relations in (24), this expression simplifies to

$$[eqn]$$

Hence, $[eqn]$ . Since $[eqn]$ was arbitrary, we conclude

$$[eqn]$$

which shows that $[eqn]$ is self-orthogonal. □

Remark 2. In this work, our primary focus is on cyclic and self-orthogonal codes over $[eqn]$ . Since $[eqn]$ is not a Frobenius ring, the theory of self-dual cyclic codes involves additional structural considerations beyond those required for self-orthogonality. Although Theorem 2 shows that the Gray map preserves self-orthogonality, the characterization of self-dual cyclic codes and their Gray images involves additional constraints and constitutes a direction for future research.

Lemma 2. Let $[eqn]$ be a cyclic code over $[eqn]$ of length n, and let $[eqn]$ be the ideal corresponding to $[eqn]$ , generated as in Theorem 1 by

$$[eqn]$$

Let $[eqn]$ be the Gray map defined in Definition 1, with $[eqn]$ satisfying $[eqn]$ as in Lemma 1. Then, for any $[eqn]$ , there exist polynomials $[eqn]$ such that

$$[eqn]$$

Moreover, the Gray image of $[eqn]$ can be expressed componentwise as

$$[eqn]$$

where

$$[eqn]$$

Proof. Let $[eqn]$ be arbitrary. By definition of I, it can be expressed in the form

$$[eqn]$$

for some polynomials $[eqn]$ . Using the relations $[eqn]$ in $[eqn]$ , the above expression simplifies to

$$[eqn]$$

as claimed.The componentwise formula for $[eqn]$ follows directly from the definition of the Gray map (Definition 1) and the choice of $[eqn]$ as in Lemma 1. □

Next, we establish that under appropriate conditions on the parameters n and p, the Gray image of a cyclic code over $[eqn]$ of length n under the map $[eqn]$ possesses a quasi-cyclic structure. Specifically, we show that $[eqn]$ is a quasi-cyclic code of length $[eqn]$ over $[eqn]$ with a well-defined index, thereby extending the cyclicity properties of $[eqn]$ in the context of its Gray image.

Lemma 3. Let $[eqn]$ be a cyclic code over $[eqn]$ of length n, and let

$$[eqn]$$

be the ideal corresponding to $[eqn]$ . Let $[eqn]$ be the Gray map defined in Definition 1, with $[eqn]$ satisfying $[eqn]$ as in Lemma 1. Then, the Gray image $[eqn]$ is a quasi-cyclic code of length $[eqn]$ over $[eqn]$ with index 6 at most.

Proof. Take any $[eqn]$ and define $[eqn]$ . Clearly, $[eqn]$ since I is an ideal. By Lemma 1, the 6-fold cyclic shift of $[eqn]$ satisfies

$$[eqn]$$

Writing this componentwise, we have

$$[eqn]$$

This shows that $[eqn]$ is invariant under the 6-fold cyclic shift, i.e., it is quasi-cyclic of index 6 at most. □

Under the assumptions of Lemma 2, we are now able to determine the precise index of the quasi-cyclic code $[eqn]$ . This allows us to characterize whether the Gray image of $[eqn]$ is cyclic, quasi-cyclic of index 3, or quasi-cyclic of index 6, providing a complete classification of its quasi-cyclic structure.

Theorem 3. *Let $[eqn]$ be a cyclic code over $[eqn]$ of length n with $[eqn]$ Then, $[eqn]$ is a quasi-cyclic code with index of either $[eqn]$ or $[eqn]$ Precisely, we have $[eqn]$ is cyclic if and only if $[eqn]$ and $[eqn]$ i.e., $[eqn]$ *

Proof. By Lemma 3, $[eqn]$ is a quasi-cyclic code of index 6 at most. Suppose that $[eqn]$ for some $[eqn]$ . Then, given $[eqn]$ , there exists $[eqn]$ such that $[eqn]$ . In fact, whenever $[eqn]$ is an element of I, we always associate polynomials $[eqn]$ of $[eqn]$ such that $[eqn]$ where $[eqn]$ are elements of $[eqn]$ defined in Lemma 1, $[eqn]$ Similarly, when we choose an element $[eqn]$ of I, we always assume that there are polynomials $[eqn]$ of $[eqn]$ so that $[eqn]$ where $[eqn]$ and

$$[eqn]$$

for each $[eqn]$ We may exclude the trivial case $[eqn]$ First, we prove that if $[eqn]$ , then $[eqn]$ has index $[eqn]$ Suppose that $[eqn]$ , and $[eqn]$ for some $[eqn]$ . Choose $[eqn]$ . If $[eqn]$ , then $[eqn]$ for some $[eqn]$ . It follows that

$$[eqn]$$

In particular, $[eqn]$ and $[eqn]$ . So, by Lemma 2,

$$[eqn]$$ $$[eqn]$$

Multiplying $[eqn]$ to both sides of Equation (27) and substituting Equation (26), we have

$$[eqn]$$

Note that this equation holds for arbitrary element $[eqn]$ of I. Hence, by setting $[eqn]$ and $[eqn]$ , we have $[eqn]$ , but $[eqn]$ , which is a contradiction. The case when $[eqn]$ follows similarly. Hence, by Lemma 2, $[eqn]$ has index $[eqn]$ and the claim is proven.Now, suppose that $[eqn]$ satisfies the conditions given in the hypothesis. Then, it is clear that $[eqn]$ is cyclic. Conversely, suppose that $[eqn]$ is cyclic. Then, given $[eqn]$ , there exists $[eqn]$ such that $[eqn]$ . So, we have

$$[eqn]$$

while

$$[eqn]$$

Given $[eqn]$ , when comparing the $[eqn]$ th, $[eqn]$ th, $[eqn]$ th, and $[eqn]$ th entries of both matrices,

$$[eqn]$$

(We write $[eqn]$ by convention). Multiplying $[eqn]$ , $[eqn]$ , and $[eqn]$ to both sides of the equations in (31), respectively, and comparing with previous equations, we obtain

$$[eqn]$$

On the other hand, by multiplying $[eqn]$ to both sides of the last equation in (31) and substituting, we have

$$[eqn]$$

Combining these two sets of equations, we obtain

$$[eqn]$$

It also follows that, if $[eqn]$ for some i, then $[eqn]$ for all $[eqn]$ , so we have $[eqn]$ by Lemma 2. Hence, we may assume that $[eqn]$ for each $[eqn]$ . Comparing the $[eqn]$ th entries of $[eqn]$ and $[eqn]$ , we have $[eqn]$ Multiplying $[eqn]$ to both sides of (15) and substituting (17), we obtain $[eqn]$ and thus $[eqn]$ . Since $[eqn]$ from our choice of $[eqn]$ and $[eqn]$ , it follows that $[eqn]$ . If $[eqn]$ , then $[eqn]$ . Suppose that $[eqn]$ . Then, $[eqn]$ so $[eqn]$ is a cyclic subgroup of a cyclic group $[eqn]$ , the multiplicative group of units of $[eqn]$ . It follows that the order of $[eqn]$ must be a multiple of 3, which happens exactly when $[eqn]$ . On the other hand, $[eqn]$ , so $[eqn]$ and $[eqn]$ . Hence, $[eqn]$ and $[eqn]$ Since this equation holds for arbitrary $[eqn]$ , by setting $[eqn]$ , we have $[eqn]$ and $[eqn]$ This means that $[eqn]$ By the claim stated above, $[eqn]$ must be $[eqn]$ and it follows that $[eqn]$ is cyclic. Hence, the result is proven. □

Remark 3. In light of the proof of Theorem 3, the results happen only if either $[eqn]$ or $[eqn]$ .

Remark 4. Let $[eqn]$ be a cyclic code of length n over $[eqn]$ , and assume $[eqn]$ . Then, the Gray image $[eqn]$ is a quasi-cyclic $[eqn]$ -linear code of length $[eqn]$ . Since the Gray map $[eqn]$ is $[eqn]$ -linear and injective, it preserves the $[eqn]$ -dimension. Hence, if $[eqn]$ , then $[eqn]$ has length $[eqn]$ and dimension k over $[eqn]$ . Thus, the Gray image has parameters in the form $[eqn]$ , where d denotes its minimum Hamming distance. Although the present work focuses primarily on the structural behavior of Gray images, particularly their quasi-cyclic index and preservation of orthogonality, a systematic investigation of minimum distance and optimality properties constitutes an interesting direction for future research.

Theorem 4. *Suppose that $[eqn]$ be a cyclic code over $[eqn]$ of length $[eqn]$ Suppose also $[eqn]$ Then, $[eqn]$ has index 3 if and only if $[eqn]$ is not cyclic and $[eqn]$ that is, $[eqn]$ *

Proof. Suppose that $[eqn]$ . We need to show that $[eqn]$ satisfies conditions given in (ii). Given $[eqn]$ , there exists $[eqn]$ such that $[eqn]$ By the proof of Theorem 3, we have $[eqn]$ . We choose $[eqn]$ then we obtain

$$[eqn]$$

where $[eqn]$ and where $[eqn]$ If we apply $[eqn]$ to the power $[eqn]$ we have

$$[eqn]$$

Assume there is $[eqn]$ such that $[eqn]$ Since $[eqn]$ can be expressed as $[eqn]$ for some $[eqn]$ The matrix associated with $[eqn]$ is of the form

$$[eqn]$$

Comparing the entries of the last columns of both matrices, we find that $[eqn]$ This yields that $[eqn]$ for all $[eqn]$ then

$$[eqn]$$

where $[eqn]$ For the converse, let $[eqn]$ , which is generated by $[eqn]$ where $[eqn]$ Thus, we have

$$[eqn]$$

Hence,

$$[eqn]$$

Choose $[eqn]$ to be of the form $[eqn]$ where $[eqn]$ is the same as that of $[eqn]$ One can see that $[eqn]$ then $[eqn]$ is with index of $[eqn]$  □

Corollary 1. *Let $[eqn]$ be a cyclic code of length n. Then, $[eqn]$ is either cyclic or has index $[eqn]$ *

Proof. Suppose that $[eqn]$ . If $[eqn]$ , then one can prove that $[eqn]$ is cyclic (the proof follows by applying the argument used in the proof of Theorem 3, and is thereby omitted). Hence, if $[eqn]$ is not cyclic, then $[eqn]$ has index 3 if $[eqn]$ , and $[eqn]$ has index 6 if its index is neither 1 nor 3. □

The aforementioned results offer a thorough examination of the algebraic framework of cyclic codes within the ring $[eqn]$ and their associated Gray pictures. They provide a comprehensive characterization of the potential indices for the Gray pictures of these codes. This characterization elucidates the relationship between the structural qualities of cyclic codes and the behavior of their Gray images, while also delineating specific criteria for identifying when the Gray image is cyclic or quasi-cyclic of index 3 or 6. Thus, these findings provide a cohesive framework for comprehending the interaction between cyclic codes over $[eqn]$ and their Gray map representations.

Corollary 2. Let $[eqn]$ be a cyclic code of length n over $[eqn]$ associated with the ideal $[eqn]$ Then, the Gray image $[eqn]$ is a quasi-cyclic code with index $[eqn]$ where $[eqn]$ and

(i)

• $[eqn]$ if and only if $[eqn]$ ;* (ii)
• $[eqn]$ if and only if $[eqn]$ ;* (iii)
• $[eqn]$ if and only if $[eqn]$ and cases (i)–(ii) do not hold.*

4. Numerical Examples

The remainder of the study focuses on elucidating the results detailed in Section 3. We present an example demonstrating the existence of cyclic codes $[eqn]$ over $[eqn]$ for which the Gray image $[eqn]$ constitutes a quasi-cyclic code of index 6, even in the case where $[eqn]$ . This example illustrates that the presence of a Gray image with index 6 does not inherently indicate that $[eqn]$ is nonzero, revealing the intricacies in the correlation between the index of the Gray image and the elements of the generating polynomials.

Example 1. Assume $[eqn]$ . We will establish that the index of $[eqn]$ is precisely 6. Observe that for any polynomial $[eqn]$ , the following identity holds:

$$[eqn]$$

Consequently, if $[eqn]$ , then by Lemma 2 we obtain

$$[eqn]$$

Thus,

$$[eqn]$$

If we set $[eqn]$ , and hence, by the definition of $[eqn]$ , we have

$$[eqn]$$

By repeatedly applying this process six times, we obtain

$$[eqn]$$

Moreover, for any $[eqn]$ we have

$$[eqn]$$

*Therefore, the index of $[eqn]$ is exactly $[eqn]$ *

In the next example, we explicitly compute the generator matrices of $[eqn]$

Example 2. Consider the cyclic code $[eqn]$ over the ring $[eqn]$ with parameters $[eqn]$ , $[eqn]$ , and $[eqn]$ . The corresponding ideal of $[eqn]$ is given by

$$[eqn]$$

where the polynomials are chosen as

$$[eqn]$$

Then, by Lemma 2, given $[eqn]$ , there exist $[eqn]$ and $[eqn]$ of $[eqn]$ such that

$$[eqn]$$

Now, set $[eqn]$ . Then, by Lemma 2, we have $[eqn]$ where

$$[eqn]$$

for each $[eqn]$ . Hence, the Gray image $[eqn]$ is a quasi-cyclic code over $[eqn]$ , generated by the set of matrices $[eqn]$ , where $[eqn]$ and $[eqn]$ . By applying the results from Section 3, one can verify that $[eqn]$ has length 24 and is a quasi-cyclic code of index $[eqn]$ .

Let us write

$$[eqn]$$

and

$$[eqn]$$

where $[eqn]$ and $[eqn]$ are elements of $[eqn]$ for $[eqn]$ . With this notation, the matrices $[eqn]$ and $[eqn]$ can be explicitly constructed from the coefficients of $[eqn]$ and $[eqn]$ , providing a full generating set for $[eqn]$ ,

$$[eqn]$$

Here are all $[eqn]$ and $[eqn]$ matrices for $[eqn]$ :

1.  Matrices $[eqn]$ associated with $[eqn]$ :

$$[eqn]$$ $$[eqn]$$

2.  Matrices $[eqn]$ associated with $[eqn]$ :

$$[eqn]$$ $$[eqn]$$

3.  Matrices $[eqn]$ associated with $[eqn]$ :

$$[eqn]$$ $$[eqn]$$

4.  Matrices $[eqn]$ associated with $[eqn]$ :

$$[eqn]$$ $$[eqn]$$

Example 3. Let $[eqn]$ and $[eqn]$ then $[eqn]$ Suppose that $[eqn]$ where $[eqn]$ . Moreover, we assume

$$[eqn]$$

For $[eqn]$ then,

$$[eqn]$$

where the associated relations $[eqn]$ are of the form

$$[eqn]$$

The associated matrices are of the form

$$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$ $$[eqn]$$

5. Conclusions

This study has analyzed the Gray images of cyclic and self-orthogonal codes of length n over the local non-Frobenius ring

$$[eqn]$$

with the conditions that $[eqn]$ . We presented the Gray map $[eqn]$ and established that, given the conditions $[eqn]$ and $[eqn]$ , every cyclic code $[eqn]$ over $[eqn]$ of length n is transformed into a quasi-cyclic code of length $[eqn]$ over $[eqn]$ with index $[eqn]$ . We demonstrated that the index of $[eqn]$ is restricted to the values $[eqn]$ or 6, and we established the necessary and sufficient conditions for each scenario. The findings offer valuable insights into the structural behavior of codes over non-chain rings and emphasize the significance of Gray maps in connecting the study of ring-based codes with quasi-cyclic codes over finite fields. Furthermore, the incorporation of numerical examples has demonstrated the practical significance of our theoretical findings.

This work presents opportunities for additional research, including the examination of other classes of codes over analogous non-chain rings, broadening the analysis to various Gray mappings, and exploring potential applications within coding theory and cryptography. In addition to the structural results obtained here, a systematic investigation of the parameters of the Gray images, particularly their minimum distance and optimality properties, would be of interest. Moreover, a complete study of self-dual cyclic codes over $[eqn]$ and the behavior of their Gray images constitutes a natural extension of the present work.