Construction of reversible cyclic codes over Fq + uFq + u²Fq.

Let q be a power of prime p. In this article, we investigate the reversible cyclic codes of arbitrary length n over the ring R = Fq +uFq + u²Fq, where u³ = 0 mod q. Further, we find a unique set of generators for cyclic codes over R and classify the reversible cyclic codes with their generators. Moreover, it is shown that the dual of reversible cyclic code over R is reversible. Finally, some examples of reversible cyclic codes are provided to justify the importance of these results. [ABSTRACT FROM AUTHOR]