Reversible cyclic codes over Fq + u Fq
Abstract
Let q be a power of a prime p. In this paper, we study reversible cyclic codes of arbitrary length over the ring R = Fq + u Fq, where u2=0 mod q. First, we find a unique set of generators for cyclic codes over R, followed by a classification of reversible cyclic codes with respect to their generators. Also, under certain conditions, it is shown that dual of reversible cyclic code is reversible over Z2+uZ2. Further, to show the importance of these results, some examples of reversible cyclic codes are provided.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.